On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. - Ishay Haviv; Oded Regev 001; Amnon Ta-Shma (Theory Comput., 2007)

Rounding Parallel Repetitions of Unique Games. - Boaz Barak; Moritz Hardt; Ishay Haviv; Anup Rao 001; Oded Regev 001; David Steurer (FOCS, 2008)

A Note on the Distribution of the Distance from a Lattice. - Ishay Haviv; Vadim Lyubashevsky; Oded Regev 001 (Discret. Comput. Geom., 2009)

The Euclidean Distortion of Flat Tori. - Ishay Haviv; Oded Regev 001 (APPROX-RANDOM, 2010)

Beating the Gilbert-Varshamov bound for online channels. - Ishay Haviv; Michael Langberg (ISIT, 2011)

Lattices and codes - Ishay Haviv (2011)

On linear index coding for random graphs. - Ishay Haviv; Michael Langberg (ISIT, 2012)

Hardness of the Covering Radius Problem on Lattices. - Ishay Haviv; Oded Regev 001 (Chic. J. Theor. Comput. Sci., 2012)

Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors. - Ishay Haviv; Oded Regev 001 (Theory Comput., 2012)

On the Lattice Isomorphism Problem. - Ishay Haviv; Oded Regev 001 (SODA, 2014)

Linear Index Coding via Semidefinite Programming. - Eden Chlamtac; Ishay Haviv (Comb. Probab. Comput., 2014)

The remote set problem on lattices. - Ishay Haviv (Comput. Complex., 2015)

The Restricted Isometry Property of Subsampled Fourier Matrices. - Ishay Haviv; Oded Regev 001 (SODA, 2016)

The List-Decoding Size of Fourier-Sparse Boolean Functions. - Ishay Haviv; Oded Regev 001 (ACM Trans. Comput. Theory, 2016)

Non-linear cyclic codes that attain the Gilbert-Varshamov bound. - Ishay Haviv; Michael Langberg; Moshe Schwartz 001; Eitan Yaakobi (ISIT, 2017)

Sunflowers and Testing Triangle-Freeness of Functions. - Ishay Haviv; Ning Xie 002 (Comput. Complex., 2017)

Symmetric Complete Sum-free Sets in Cyclic Groups. - Ishay Haviv; Dan Levy (Electron. Notes Discret. Math., 2017)

On Minrank and the Lovász Theta Function. - Ishay Haviv (APPROX-RANDOM, 2018)

Dioid partitions of groups. - Ishay Haviv; Dan Levy (Eur. J. Comb., 2018)

Approximating the Orthogonality Dimension of Graphs and Hypergraphs. - Ishay Haviv (MFCS, 2019)

H-wise Independence. - Ishay Haviv; Michael Langberg (Chic. J. Theor. Comput. Sci., 2019)

Topological bounds on the dimension of orthogonal representations of graphs. - Ishay Haviv (Eur. J. Comb., 2019)

Sum-Free Sets of Integers with a Forbidden Sum. - Ishay Haviv (SIAM J. Discret. Math., 2019)

On Minrank and Forbidden Subgraphs. - Ishay Haviv (ACM Trans. Comput. Theory, 2019)

Minimizing the alphabet size of erasure codes with restricted decoding sets. - Mira Gonen; Ishay Haviv; Michael Langberg; Alex Sprintson (ISIT, 2020)

Task-Based Solutions to Embedded Index Coding. - Ishay Haviv (IEEE Trans. Inf. Theory, 2020)

A Fixed-Parameter Algorithm for the Kneser Problem. - Ishay Haviv (ICALP, 2022)

A Fixed-Parameter Algorithm for the Schrijver Problem. - Ishay Haviv (IPEC, 2022)

The Complexity of Finding Fair Independent Sets in Cycles. - Ishay Haviv (Comput. Complex., 2022)

On the Subspace Choosability in Graphs. - Dror Chawin; Ishay Haviv (Electron. J. Comb., 2022)

The Binary Rank of Circulant Block Matrices. - Ishay Haviv; Michal Parnas (CoRR, 2022)

Upper bounds on the Boolean rank of Kronecker products. - Ishay Haviv; Michal Parnas (Discret. Appl. Math., 2022)

The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. - Alexander Golovnev; Ishay Haviv (Adv. Math. Commun., 2022)

On the binary and Boolean rank of regular matrices. - Ishay Haviv; Michal Parnas (J. Comput. Syst. Sci., 2023)

Local orthogonality dimension. - Inon Attias; Ishay Haviv (J. Graph Theory, 2023)

Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. - Dror Chawin; Ishay Haviv (SIAM J. Discret. Math., 2023)

Testing Intersectingness of Uniform Families. - Ishay Haviv; Michal Parnas (APPROX/RANDOM, 2024)

Nearly Orthogonal Sets over Finite Fields. - Dror Chawin; Ishay Haviv (SoCG, 2024)

Kernelization for Orthogonality Dimension. - Ishay Haviv; Dror Rabinovich (IPEC, 2024)

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems. - Ishay Haviv (SIAM J. Comput., 2024)

Hardness of Linear Index Coding on Perturbed Instances. - Dror Chawin; Ishay Haviv (IEEE Trans. Inf. Theory, 2024)

On Finding Constrained Independent Sets in Cycles. - Ishay Haviv (Algorithmica, 2024)

Minimizing the Alphabet Size in Codes With Restricted Error Sets. - Mira Gonen; Ishay Haviv; Michael Langberg; Alex Sprintson (IEEE Trans. Inf. Theory, 2024)

Improved Approximation Algorithms for Index Coding. - Dror Chawin; Ishay Haviv (IEEE Trans. Inf. Theory, 2024)

New Hardness Results for Low-Rank Matrix Completion. - Dror Chawin; Ishay Haviv (MFCS, 2025)

A near-optimal kernel for a coloring problem. - Ishay Haviv; Dror Rabinovich (Discret. Appl. Math., 2025)

Larger nearly orthogonal sets over finite fields. - Ishay Haviv; Sam Mattheus; Aleksa Milojevic; Yuval Wigderson (Discret. Math., 2025)

Kernels for storage capacity and dual index coding. - Ishay Haviv (J. Comb. Theory, Ser. A, 2025)

The Chromatic Number of Kneser Hypergraphs via Consensus Division. - Ishay Haviv (ACM Trans. Comput. Theory, 2025)

Kernelization for H-Coloring. - Yael Berkman; Ishay Haviv (CoRR, 2025)