Updated: June 2011
Education
1999-2003 |
Ph.D., Computer Science, Weizmann Institute of Science (Rehovot, Israel)
Dissertation: Coping with NP-hardness: Approximation algorithms based on semidefinite programming
Advisor: Prof. Uriel Feige
|
1997-1998 |
M.Sc., Computer Science, Weizmann Institute of Science (Rehovot, Israel)
Thesis: Approximation Algorithms for Maximization Problems arising in Graph Partitioning
Advisor: Prof. Uriel Feige
|
1994-1996 |
B.Sc., Mathematics and Computer Science (summa cum laude), Tel-Aviv University (Tel-Aviv, Israel)
|
Research Interests
|
My
studies and research are in the fields of Theoretical Computer Science and Information Theory. My broad area of interest is in the design and analysis of algorithms for combinatorial problems. I have special interest in algorithmic and combinatorial aspects of Information Theory and in the study of approximation algorithms for NP-hard problems. Closely related interests of mine include computational and combinatorial geometry, probabilistic methods in combinatorics, the use of randomization in computation, coding theory and computational complexity.
|
Positions Held
2006 - |
Senior Faculty,
Department of Mathematics and Computer Science, The Open University of Israel (Raanana, Israel).
|
2003 - 2006 |
Postdoctoral Scholar,
Department of Computer Science, California Institute of Technology (Pasadena, CA)
|
Summer 2003 |
Research Assistant,
Department of Computer Science, Tel-Aviv University (Tel-Aviv, Israel).
Advisor: Prof. Uri Zwick
|
|