* Both talks will be held at The Helen and Martin Kimmel Hall
Prof. Shan Muthukrishnan (Rutgers University):
Prof. Muthukrishnan work in designing and analyzing algorithms, with applications in variety of areas from analyzing data streams to Internet auctions, databases, networking, compression, string matching and other areas.
More information about his research and a list of his publications is available here.
Prof. Bernhard Haeupler (Carnegie Mellon University):
Bernhard is a theoretical computer scientist working on the design and analysis of algorithms for combinatorial problems. He particularly likes to work on problems
in distributed computing and use the power of randomization. Much of his work intermixes these classical topics with questions, ideas, and tools from (network) coding theory, and information theory.
Most recently he got particularly interested in error correcting coding schemes for interactive communications and distributed network optimization algorithms.
More information about his research and a list of his publications is availableon Bernhard's research group website.
Cryptography and Security Track:
* Will be held at Zeevi Hall
Prof. Yehuda Lindell (Bar Ilan University):
Yehuda is a professor in the Department of Computer Science at Bar Ilan University. Prior to coming to Bar-Ilan in 2004, he was a Raviv Postdoctoral fellow in the Cryptographic Research Group at the IBM T.J.Watson Research Center.
He is the director of the Bar-Ilan Center for Research in Applied Cryptography and Cyber Security and is currently involved in a new company called Dyadic Security that is involved in applying secure computation to the critical problem of server breach.
His main fields of interest are in the field of cryptography, with a focus on secure protocols.
Eylon Yogev (Weizmann Institute):
Eylon is a Ph.D. student at Weizmann Institute of Science under Prof. Moni Naor's supervision.
He completed his M.Sc at Weizmann in 2013 under the same supervisor.
He is interested in theoretical computer science, and in particular in subjects as cryptography, (total) search problems and data structures.
Prof. Yuval Ishai (Technion & UCLA)
Yuval has a broad general interest in theoretical computer science, with cryptography being his main research area.
Dr. Tal Moran (IDC):
Tal is a faculty member in the School of Computer Science at the Interdisciplinary Center Herzliya. Previously he was a postdoctoral research fellow at the Center for Research on Computation and Society at Harvard University advised by Salil Vadhan.
He did his Phd at The Weizmann Institute of Science under the supervision of Moni Naor.
His research focuses on employing ideas and techniques from theoretical cryptography to design secure systems in the "real world". He's also interested the foundations of cryptography and the theory of cryptography in general.
* Will be held at Class 6
Prof. Liad Blumrosen (HUJI):
Liad is a faculty member at the School of Business Administration at the Hebrew University. He is a member at the Federmann Center for the Study of Rationality.
He is interested in Internet Economics, Algorithmic Game Theory, Auction Design and Electronic Commerce.
Prof. Shahar Dobzinski (Weizmann):
Shahar is a faculty member of Weizmann's applied math and computer science department.
His general research area is algorithmic game theory, an area on the intersection of computer science, game theory, and economics. Specifically, he usually studies the theory
of computer science aspects of problems in algorithmic mechanism design. He is also interested in other related areas of theoretical computer science, such as approximation algorithms.
Prof. Yossi Azar (TAU):
Yossi is a professor in the school of computer science at Tel Aviv university. His His research interests include design and analysis of discrete algorithms, especially related to online and approximations algorithms and algorithmic game theory.
Dr. Katrina Ligett (HUJI):
Katrina is a Senior Lecturer (Assistant Professor) of Computer Science. She is also a
Member at The Federmann Center for the Study of Rationality
Hebrew University and an Assistant Professor of Computer Science and Economics (on leave)
Dr. Eden Chlamtac (BGU):
Eden is an Assistant professor at the Department of Computer Science at Ben Gurion University.
He is primarily interested in approximation algorithms which exploit convex optimization tools (e.g. linear programming, semi-definite programming).
Much of his work (though by no means all) focuses on demonstrating the potential of hierarchies of convex relaxations, which until recently remained outside the algorithmic toolkit.
Dr. Laszlo Kozma (TAU):
Laszlo is a a researcher in computer science, currently working as a postdoc at Tel Aviv University.
He is interested in algorithms and combinatorics, and other related (and unrelated) topics.
Computer Networks Track:
* Will be held at Benei Zion Hall
Dr. Rotem Oshman (TAU):
Rotem is a member of the Department of Computer Science at Tel-Aviv University. Her main research interests are distributed computing, communication complexity, and formal methods in computer science.
Prof. Michael Schapira (HUJI):
Michael is an associate professor at the School of Computer Science and Engineering, the Hebrew University of Jerusalem. He is also the scientific co-leader of the Fraunhofer Cybersecurity Center at Hebrew University.
His research interests focus on the protocols/mechanisms that make the Internet tick (e.g., for routing, traffic management). He is interested in the design and analysis of practical
(Inter)network architectures and protocols with provable guarantees (failure-resilience, optimality, security, incentive compatibility, and beyond).
He is also broadly interested in the the interface of computer science, economics, and game theory (e.g., dynamic interactions in economic and computational environments,
incentive-compatible computation, computational auctions, and more).
Prof. David hay (HUJI):
David Hay is an associate professor at the Rachel and Selim Benin School of Computer Science and Engineering, Hebrew University, Jerusalem, Israel.
He received his BA (summa cum laude) and PhD degree in computer science from the Technion - Israel Institute of Technology in 2001 and 2007, respectively. His PhD dissertation, entitled “Competitive Evaluation of Switch Architectures”, was done under the supervision of Prof. Hagit Attiya.
Between 1999-2002, David Hay was with IBM Haifa Research Labs. During summer 2006, he was interning at the Data Center Business Unit of Cisco Systems, San Jose. In 2007-2008, he was a post-doc fellow at the department of computer science, Ben Gurion University of the Negev, Israel. During that time he was also an adjunct lecturer in the Interdisciplinary Center, Hertzelia, Israel. In 2008-2009, David was a postdoc fellow of the Electronic Department at Politecnico di Torino. In 2009-2010, he was a postdoctoral research scientist in the Electrical Engineering Department at Columbia University, New York, NY.
David is a TPC memeber of INFOCOM 2013, INFOCOM 2012, INFOCOM 2011, INFOCOM 2010, INFOCOM WiP 2010, WONS 2012, WONS 2011, WONS 2010, IFIP Performance 2011, HPSR 2012, HPSR 2011, HPSR 2010, ICCCN 2010, FOMC 2011, Hot Interconnects 2011, Globecom 2012, ICC 2013, ICC 2012, and ICC 2011.
He is also a co-organizer (with Hanoch Levy) of the 2011 Israeli Networking Seminar and a member of DEEPNESS Lab.
Prof. Idit Keidar (Technion):
Idit's research is broadly in fault-tolerant distributed and concurrent algorithms and systems, theory and practice. Recently, she's mostly interested in: distributed storage and concurrent data structures and transactions.
Dr. Ofer Shayevitz (TAU):
Ofer is a faculty member in the Department of EE - Systems at Tel Aviv University.
He serves as the Head of the Advanced Communication Center (ACC).
His research interests are in the areas of Information Theory, Communications, and
Statistical Signal Processing.
Dr. Ittay Eyal (Technion):
Eyal's research esearch focuses on the security and scalability of distributed systems,
in particular blockchain protocols and trusted execution environments. I have previously worked on distributed storage algorithms and data aggregation in sensor networks.