Publications

•	H-wise Independence Ishay Haviv, Michael Langberg ITCS 2013.
•	The Remote Set Problem on Lattices Ishay Haviv APPROX 2012.
•	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.
•	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 Theory of Computing 8(23), pp. 513-531, 2012. Preliminary version in 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(3), pp. 45-60, 2007.
•	Hardness of the Covering Radius Problem on Lattices Ishay Haviv, Oded Regev Chicago Journal of Theoretical Computer Science 2012(4), 2012. Preliminary version in CCC 2006.