Ishay Haviv

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 59

Top Topics

Totally Unimodular

Boolean Functions

Prime Implicants

Top Venues

IEEE Trans. Inf. Theory

Comput. Complex.

Publications

Dror Chawin, Ishay Haviv
Nearly Orthogonal Sets over Finite Fields. CoRR (2024)
Ishay Haviv
On Finding Constrained Independent Sets in Cycles. Algorithmica 86 (4) (2024)
Ishay Haviv, Michal Parnas
Testing Intersectingness of Uniform Families. CoRR (2024)
Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson
Minimizing the Alphabet Size in Codes With Restricted Error Sets. IEEE Trans. Inf. Theory 70 (6) (2024)
Dror Chawin, Ishay Haviv
Nearly Orthogonal Sets over Finite Fields. SoCG (2024)
Ishay Haviv
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems. SIAM J. Comput. 53 (2) (2024)
Ishay Haviv, Sam Mattheus, Aleksa Milojevic, Yuval Wigderson
Larger Nearly Orthogonal Sets over Finite Fields. CoRR (2024)
Dror Chawin, Ishay Haviv
Hardness of Linear Index Coding on Perturbed Instances. IEEE Trans. Inf. Theory 70 (2) (2024)
Ishay Haviv
The Chromatic Number of Kneser Hypergraphs via Consensus Division. ITCS (2024)
Dror Chawin, Ishay Haviv
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. CoRR (2023)
Inon Attias, Ishay Haviv
Local orthogonality dimension. J. Graph Theory 104 (2) (2023)
Ishay Haviv
On Finding Constrained Independent Sets in Cycles. ICALP (2023)
Dror Chawin, Ishay Haviv
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. STACS (2023)
Ishay Haviv, Michal Parnas
On the binary and Boolean rank of regular matrices. J. Comput. Syst. Sci. 134 (2023)
Dror Chawin, Ishay Haviv
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. SIAM J. Discret. Math. 37 (4) (2023)
Ishay Haviv
On Finding Constrained Independent Sets in Cycles. CoRR (2023)
Ishay Haviv
The Chromatic Number of Kneser Hypergraphs via Consensus Division. CoRR (2023)
Dror Chawin, Ishay Haviv
On the Subspace Choosability in Graphs. Electron. J. Comb. 29 (2) (2022)
Ishay Haviv, Michal Parnas
On the Binary and Boolean Rank of Regular Matrices. MFCS (2022)
Dror Chawin, Ishay Haviv
Hardness of Linear Index Coding on Perturbed Instances. Allerton (2022)
Ishay Haviv, Michal Parnas
On the Binary and Boolean Rank of Regular Matrices. CoRR (2022)
Ishay Haviv, Michal Parnas
Upper bounds on the Boolean rank of Kronecker products. Discret. Appl. Math. 318 (2022)
Ishay Haviv
A Fixed-Parameter Algorithm for the Kneser Problem. CoRR (2022)
Ishay Haviv
A Fixed-Parameter Algorithm for the Kneser Problem. ICALP (2022)
Ishay Haviv
A Fixed-Parameter Algorithm for the Schrijver Problem. CoRR (2022)
Alexander Golovnev, Ishay Haviv
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. Theory Comput. 18 (2022)
Ishay Haviv
The Complexity of Finding Fair Independent Sets in Cycles. Comput. Complex. 31 (2) (2022)
Ishay Haviv, Michal Parnas
The Binary Rank of Circulant Block Matrices. CoRR (2022)
Ishay Haviv
A Fixed-Parameter Algorithm for the Schrijver Problem. IPEC (2022)
Ishay Haviv, Michal Parnas
Upper Bounds on the Boolean Rank of Kronecker Products. LAGOS (2021)
Ishay Haviv
The Complexity of Finding Fair Independent Sets in Cycles. ITCS (2021)
Alexander Golovnev, Ishay Haviv
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. Computational Complexity Conference (2021)
Inon Attias, Ishay Haviv
Local Orthogonality Dimension. CoRR (2021)
Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson
Minimizing the alphabet size of erasure codes with restricted decoding sets. ISIT (2020)
Ishay Haviv
Task-Based Solutions to Embedded Index Coding. IEEE Trans. Inf. Theory 66 (10) (2020)
Ishay Haviv
The Complexity of Finding Fair Independent Sets in Cycles. CoRR (2020)
Alexander Golovnev, Ishay Haviv
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. CoRR (2020)
Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson
Minimizing the alphabet size of erasure codes with restricted decoding sets. CoRR (2020)
Ishay Haviv, Michael Langberg
H-wise Independence. Chic. J. Theor. Comput. Sci. 2019 (2019)
Ishay Haviv
Sum-Free Sets of Integers with a Forbidden Sum. SIAM J. Discret. Math. 33 (1) (2019)
Ishay Haviv
Approximating the Orthogonality Dimension of Graphs and Hypergraphs. MFCS (2019)
Ishay Haviv
Approximating the Orthogonality Dimension of Graphs and Hypergraphs. CoRR (2019)
Ishay Haviv
Topological bounds on the dimension of orthogonal representations of graphs. Eur. J. Comb. 81 (2019)
Ishay Haviv
On Minrank and Forbidden Subgraphs. ACM Trans. Comput. Theory 11 (4) (2019)
Ishay Haviv
Task-based Solutions to Embedded Index Coding. CoRR (2019)
Ishay Haviv
On Minrank and the Lovász Theta Function. CoRR (2018)
Ishay Haviv
On Minrank and Forbidden Subgraphs. APPROX-RANDOM (2018)
Ishay Haviv, Oded Regev, Amnon Ta-Shma
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. CoRR (2018)
Ishay Haviv, Dan Levy
Dioid partitions of groups. Eur. J. Comb. 73 (2018)
Ishay Haviv
Topological Bounds on the Dimension of Orthogonal Representations of Graphs. CoRR (2018)
Ishay Haviv, Oded Regev
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors. CoRR (2018)
Ishay Haviv
On Minrank and the Lovász Theta Function. APPROX-RANDOM (2018)
Ishay Haviv
On Minrank and Forbidden Subgraphs. CoRR (2018)
Ishay Haviv, Ning Xie
Sunflowers and Testing Triangle-Freeness of Functions. Comput. Complex. 26 (2) (2017)
Ishay Haviv, Michael Langberg, Moshe Schwartz, Eitan Yaakobi
Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound. CoRR (2017)
Ishay Haviv, Dan Levy
Symmetric Complete Sum-free Sets in Cyclic Groups. Electron. Notes Discret. Math. 61 (2017)
Ishay Haviv, Michael Langberg, Moshe Schwartz, Eitan Yaakobi
Non-linear cyclic codes that attain the Gilbert-Varshamov bound. ISIT (2017)
Ishay Haviv, Oded Regev
The Restricted Isometry Property of Subsampled Fourier Matrices. SODA (2016)
Ishay Haviv, Oded Regev
The List-Decoding Size of Fourier-Sparse Boolean Functions. ACM Trans. Comput. Theory 8 (3) (2016)
Ishay Haviv, Oded Regev
The List-Decoding Size of Fourier-Sparse Boolean Functions. CoRR (2015)
Ishay Haviv, Oded Regev
The List-Decoding Size of Fourier-Sparse Boolean Functions. Computational Complexity Conference (2015)
Ishay Haviv
The remote set problem on lattices. Comput. Complex. 24 (1) (2015)
Ishay Haviv, Ning Xie
Sunflowers and Testing Triangle-Freeness of Functions. ITCS (2015)
Ishay Haviv, Oded Regev
The Restricted Isometry Property of Subsampled Fourier Matrices. CoRR (2015)
Ishay Haviv, Oded Regev
On the Lattice Isomorphism Problem. SODA (2014)
Ishay Haviv, Ning Xie
Sunflowers and Testing Triangle-Freeness of Functions. CoRR (2014)
Eden Chlamtac, Ishay Haviv
Linear Index Coding via Semidefinite Programming. Comb. Probab. Comput. 23 (2) (2014)
Ishay Haviv, Michael Langberg
H-wise independence. ITCS (2013)
Ishay Haviv, Oded Regev
On the Lattice Isomorphism Problem. CoRR (2013)
Ishay Haviv, Oded Regev
Hardness of the Covering Radius Problem on Lattices. Chic. J. Theor. Comput. Sci. 2012 (2012)
Ishay Haviv
The Remote Set Problem on Lattices. APPROX-RANDOM (2012)
Eden Chlamtac, Ishay Haviv
Linear index coding via semidefinite programming. SODA (2012)
Ishay Haviv, Michael Langberg
On linear index coding for random graphs. ISIT (2012)
Ishay Haviv, Oded Regev
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors. Theory Comput. 8 (1) (2012)
Ishay Haviv, Michael Langberg
Beating the Gilbert-Varshamov bound for online channels. ISIT (2011)
Ishay Haviv, Michael Langberg
On Linear Index Coding for Random Graphs CoRR (2011)
Eden Chlamtac, Ishay Haviv
Linear Index Coding via Semidefinite Programming CoRR (2011)
Ishay Haviv, Michael Langberg
Beating the Gilbert-Varshamov Bound for Online Channels CoRR (2011)
Ishay Haviv, Oded Regev
The Euclidean Distortion of Flat Tori. APPROX-RANDOM (2010)
Ishay Haviv, Vadim Lyubashevsky, Oded Regev
A Note on the Distribution of the Distance from a Lattice. Discret. Comput. Geom. 41 (1) (2009)
Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer
Rounding Parallel Repetitions of Unique Games. FOCS (2008)
Ishay Haviv, Oded Regev, Amnon Ta-Shma
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. Theory Comput. 3 (1) (2007)
Ishay Haviv, Oded Regev
Tensor-based hardness of the shortest vector problem to within almost polynomial factors. STOC (2007)
Ishay Haviv, Oded Regev
Hardness of the Covering Radius Problem on Lattices. Computational Complexity Conference (2006)