Research Interests
 
Theoretical computer science, computational complexity, lattices, hardness of approximation, coding theory, combinatorics.

Ishay Haviv
ישי חביב
Ph.D., Computer Science, 2011
Foundations of Computing Group
Blavatnik School of Computer Science
Tel Aviv University

Supported by the Adams Fellowship Program of the
Israel Academy of Sciences and Humanities

Advisor: Prof. Oded Regev

Tel: (+972)-3-640-7885
Email: havivish at post dot tau dot ac dot il
Publications
Teaching (Tel Aviv University)
• Linear Index Coding via Semidefinite Programming
Eden Chlamtac, Ishay Haviv
SODA 2012
• On Linear Index Coding for Random Graphs
Ishay Haviv, Michael Langberg
ISIT 2012, to appear
• Beating the Gilbert-Varshamov Bound for Online Channels
Ishay Haviv, Michael Langberg
ISIT 2011
• The Euclidean Distortion of Flat Tori
Ishay Haviv, Oded Regev
APPROX 2010
• A Note on the Distribution of the Distance from a Lattice
Ishay Haviv, Vadim Lyubashevsky, Oded Regev
Discrete & Computational Geometry 41(1), pp. 162-176, 2009
• Rounding Parallel Repetitions of Unique Games
Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer
FOCS 2008
• Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Ishay Haviv, Oded Regev
STOC 2007
• On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy
Ishay Haviv, Oded Regev, Amnon Ta-Shma
Theory of Computing 3(1), pp. 45-60, 2007
• Hardness of the Covering Radius Problem on Lattices
Ishay Haviv, Oded Regev
CCC 2006
• Discrete Mathematics (TA): Spring 2007, Summer 2007, Fall 2007, Fall 2008
• Discrete Mathematics (Lecturer): Fall 2009, Fall 2010
• Computational Complexity (TA): Spring 2008, Spring 2009, Spring 2011