2009 |
5 | EE | Ishay Haviv,
Vadim Lyubashevsky,
Oded Regev:
A Note on the Distribution of the Distance from a Lattice.
Discrete & Computational Geometry 41(1): 162-176 (2009) |
2008 |
4 | EE | Boaz Barak,
Moritz Hardt,
Ishay Haviv,
Anup Rao,
Oded Regev,
David Steurer:
Rounding Parallel Repetitions of Unique Games.
FOCS 2008: 374-383 |
2007 |
3 | EE | Ishay Haviv,
Oded Regev:
Tensor-based hardness of the shortest vector problem to within almost polynomial factors.
STOC 2007: 469-477 |
2 | EE | Ishay Haviv,
Oded Regev,
Amnon Ta-Shma:
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy.
Theory of Computing 3(1): 45-60 (2007) |
2006 |
1 | EE | Ishay Haviv,
Oded Regev:
Hardness of the Covering Radius Problem on Lattices.
IEEE Conference on Computational Complexity 2006: 145-158 |