I-CORE Day

Weizmann Institute of Science | Wednesday, April 20, 2016






Key-note Speakers:
* Both talks will be held at The Helen and Martin Kimmel Hall


      Prof. Rasmus Pagh (IT University of Copenhagen):


    Rasmus is professor in the Algorithms Group, and head of the Theoretical Computer Science section at the IT University of Copenhagen, Denmark. He is part of the Copenhagen algorithms community. He received his PhD in 2002 from BRICS at the Department of Computer Science, Aarhus University, supervised by Peter Bro Miltersen.

    His scientific interests are within algorithms and data structures, with an emphasis on big data. He has worked extensively on basic questions in information retrieval and the role of randomness in computing, on problems with applications in databases and knowledge discovery, and on the exploitation of parallelism in modern computer architectures. He is currently running an ERC-funded project on Scalable Similarity Search.

    More information about his research and a list of his publications is available here.



    Tal Rabin (IBM T.J.Watson Research Center):

    Tal is the head of the Cryptography Research Group at the IBM T.J.Watson Research Center.

    Her research interests are in Cryptography and Network Security. More specifically she works on the design of efficient and provably secure cryptographic algorithms. She also works on secure distributed protocols and the theoretical foundations of cryptography. Other things that interest her are number theory, theory of algorithms and distributed systems.

    Before joining IBM Research, she received a Ph.D. in Computer Science from the Hebrew University of Jerusalem and was an NSF Postdoctoral Fellow at the MIT Laboratory for Computer Science.

    More information about her research and a list of his publications is available from her research group website.


Cryptography and Security Track:
* Will be heald at The Helen and Martin Kimmel Hall


    Prof. Alon Rosen (IDC):


    Alon is an associate professor in the School of Computer Science at the Herzliya Interdisciplinary Center.

    Before that he spent two years as a postdoc in the Cryptography Group of MIT's Computer Science and AI Lab, and two years as a postdoc in the Center for Research on Computation and Society at Harvard's department of Electrical Engineering and Computer Science.

    He did his Ph.D. at the Weizmann Institute of Science, under the supervision of Oded Goldreich and Moni Naor and graduated in 2003.

    His main fields of interest are Cryptography and Computational Complexity.


    Henry Corrigan-Gibbs (Stanford):


    Henry is a third-year PhD student in computer science at Stanford advised by Dan Boneh. Before that he graduated from Yale University in 2010 with a B.S. in computer science.

    His esearch focuses on building systems that provide new and useful security properties. His favorite systems are ones that lend themselves to rigorous formal analysis but that are also practical enough to implement and use.


    Ido Shahaf (The Hebrew University)


    Marshall Ball (Columbia University):


    Marshall Maynard Ball received his BA from Wesleyan University in 2006. Upon graduating, Ball worked in the art world for a couple of years. He is currently a graduate student at Columbia University, where he studies a variety of topics related to theoretical computer science: cryptography, complexity, learning, algorithms, logic, algebra, etc. Ball is also interested in fabrication technology.


    Prof. Eli Ben-Sasson (Technion):


    Eli is a professor of computer science at Technion – Israel Institute of Technology. His main interest is theoretical computer science (TCS), the study of the mathematical foundations of computation, and within TCS his focus is on computational complexity..




Algorithmic Game Theory and Algorithms and Computation Track:
* Will be held at The Presidential Reception Room



    Prof. Noam Nisan (The Hebrew University of Jerusalem):


    Noam is a Professor of Computer Science in the School of Engineering and Computer Science of the Hebrew University of Jerusalem. He is also a member of the Center for the Study of Rationality.

    He is interested in the border of Computer Science, Game Theory, and Economics, an area often called "Algorithmic Game Theory" or "Economics and Computation". In particular He is interested in electronic markets and auctions.


    Dr. Sigal Oren (Ben Gurion University):


    Sigal is a senior lecturer (assistant professor) at the Department of Computer Science, Ben-Gurion University.

    Previously to joining BGU she was postdoc at the Hebrew University and MSR Herzeliya hosted by Noam Nisan. She graduated from Cornell University where she had Jon Kleinberg as her advisor.


    Dr. Inbal Talgam-Cohen (The Hebrew University and Tel Aviv University):


    Inbal is a postdoctorate student and a fellow at the Israeli center of research excellence in algorithms (I-CORE ALGO) at The Hebrew University and Tel Aviv University, under the supervision of Prof. Noam Nisan, Prof. Amos Fiat and Prof. Michal Feldman.

    Her research interests are Mechanism and Market Design, Revenue and Pricing, Online Markets Optimization, Game Theory, Algorithms and Randomization and Microeconomics.


    Prof. Yuval Rabani (The Hebrew University):


    Rabani's research interests include:
  • On-line computing: k-server, file allocation, reordering buffer, randomized algorithms.
  • Network optimization: packet and circuit routing, admission control, flow control.
  • Cutting and labeling graphs: sparsest cut, multiway cut, and their relatives.
  • Resource allocation problems: scheduling, load balancing, bin packing, bandwidth allocation.
  • Sketching high dimensional data, applications to nearest neighbor search and clustering.
  • Metric Ramsey phenomena and their applications.
  • Graph decompositions, Lipschitz maps of finite metrics, and approximation algorithms.
  • Properties, applications of transportation metrics, discrete Lipschitz extension and selection.
  • Local vs. global properties of metric spaces.
  • Pseudorandom generators that fool geometric tests, explicit geometric constructions.
  • Bargaining networks.
  • Computational aspects of discrete dynamical processes.


  • Prof. Rabani serves on the editorial board of SICOMP and Algorithmica.


    Dr. Roy Schwatrz (Technion):


    Roy's research interests are design and analysis of algorithms, combinatorial optimization, approximation algorithms, the geometry of metric spaces and its applications, submodular optimization, and randomized algorithms.


    Prof. Robert Krauthgamer (Weizmann Institute of Science):


    Robert is mostly interested in Analysis of Algorithms. Some more specific areas are: Data Analysis and Massive Data Sets, Combinatorial Optimization, Approximation Algorithms and Hardness of Approximation Average-case Analysis and Heuristics, Embeddings of Finite Metrics, Routing and Peer to Peer networks. He also has a broad general interest in Discrete Mathematics and High-Dimensional Geometry.


Computer Networks Track:
* Will be held at The Edmund A. and Arlene Grossman Hall


    Prof. Danny Raz (Bell Labs and Technion):


    Prof. Raz's main research interests are the theory and applications of efficient network and system management. In particular he is working in the following directions:

  • Cloud Resource Management
  • SDN, TE, and Efficient Network Management
  • Network aware services and Programmable Networks
  • Wireless and cellular networks
  • Theory of network and system management
  • QoS routing, Network location problems, and other network related optimization problems


    Oded Padon (Tel Aviv University):


    Oded is a second year PhD student in computer science, advised by Professor Mooly Sagiv. His research interests are programming languages, verification, shape analysis, logic, networks and distributed systems.


    Yotam Harchol (The Hebrew University):


    Yotam is a PhD student at the Hebrew University of Jerusalem, Israel. His research is focused on network middleboxes and virtual network functions: He works on making them faster, smarter, cheaper, and easier. His advisers are Prof. David Hay (HUJI) and Prof. Anat Bremler-Barr (IDC) and he is a member of the DEEPNESS Lab.


    Asaf Valadarsky (The Hebrew University)


    Asaf is a first year Phd student at the School of Computer Science and Engineering, The Hebrew University of Jerusalem (HUJI), under the supervision of Dr. Michael Schapira.

    He is interested in the design of novel high-performance datacenter architectures (e.g., rack-scale computing, hybrid electrical/optical switching, new network topologies and protocols, and more). He is also a Microsoft Research PhD Scholar.


    Dr. Haya Shulman (Fraunhofer SIT)


    Haya is the head of cybersecurity and analytics department at Fraunhofer SIT. Before that she was a research group leader in the European Center for Security and Privacy by Design (EC-SPRIDE), headed by Prof. Dr. Michael Waidner, and earlier a postdoctoral researcher in EC-SPRIDE. Her research interests are in network and cyber security, focusing on attacks and on devising countermeasures. Haya conducted her Ph.D. with Prof. Dr. Amir Herzberg, with thesis in network security.

    In 2011 and 2013 she received the ‘Checkpoint Institute for Information Security (CPIIS)’ awards, in 2013 she received the Feder prize for her research in communication technologies and in 2013 and 2014 ICANN research fellowships. In 2014 Haya received the Bar-Ilan university Rector prize for her achievements in research, and in 2015 she was awarded an IETF/IRTF Applied Networking Research Prize.


    Gideon Blocq (Technion)


    Gideon is a Ph.D. Candidate at the Department of Electrical Engineering, Technion - Israel Institute of Technology.

    His research interests lie in the intersection of Computer Networks, Algorithms and Game Theory. This includes:

  • Routing Games
  • Algorithmic Game Theory
  • Auction Theory



       
    Supported by the I-CORE Program of the planning and Budgeting Committee and the Israel Science Foundation (grant No. 4/11).
-->