We stand with Ukraine  

Ishay Haviv

Orcid: 0000-0002-2903-076X

According to our database1, Ishay Haviv authored at least 41 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Finding Constrained Independent Sets in Cycles.
[BibTeX]
[DOI]
Ishay Haviv
Algorithmica, April, 2024

Hardness of Linear Index Coding on Perturbed Instances.
[BibTeX]
[DOI]
Dror Chawin
,
Ishay Haviv
IEEE Trans. Inf. Theory, February, 2024

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems.
[BibTeX]
[DOI]
Ishay Haviv
SIAM J. Comput., 2024

Nearly Orthogonal Sets over Finite Fields.
[BibTeX]
[DOI]
Dror Chawin
,
Ishay Haviv
CoRR, 2024

The Chromatic Number of Kneser Hypergraphs via Consensus Division.
[BibTeX]
[DOI]
Ishay Haviv
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank.
[BibTeX]
[DOI]
Dror Chawin
,
Ishay Haviv
SIAM J. Discret. Math., December, 2023

Local orthogonality dimension.
[BibTeX]
[DOI]
Inon Attias
,
Ishay Haviv
J. Graph Theory, October, 2023

On the binary and Boolean rank of regular matrices.
[BibTeX]
[DOI]
Ishay Haviv
,
Michal Parnas
J. Comput. Syst. Sci., June, 2023

2022
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications.
[BibTeX]
[DOI]
Alexander Golovnev
,
Ishay Haviv
Theory Comput., 2022

Upper bounds on the Boolean rank of Kronecker products.
[BibTeX]
[DOI]
Ishay Haviv
,
Michal Parnas
Discret. Appl. Math., 2022

The Binary Rank of Circulant Block Matrices.
[BibTeX]
[DOI]
Ishay Haviv
,
Michal Parnas
CoRR, 2022

On the Subspace Choosability in Graphs.
[BibTeX]
[DOI]
Dror Chawin
,
Ishay Haviv
Electron. J. Comb., 2022

The Complexity of Finding Fair Independent Sets in Cycles.
[BibTeX]
[DOI]
Ishay Haviv
Comput. Complex., 2022

A Fixed-Parameter Algorithm for the Schrijver Problem.
[BibTeX]
[DOI]
Ishay Haviv
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

A Fixed-Parameter Algorithm for the Kneser Problem.
[BibTeX]
[DOI]
Ishay Haviv
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2020
Task-Based Solutions to Embedded Index Coding.
[BibTeX]
[DOI]
Ishay Haviv
IEEE Trans. Inf. Theory, 2020

Minimizing the alphabet size of erasure codes with restricted decoding sets.
[BibTeX]
[DOI]
Mira Gonen
,
Ishay Haviv
,
Michael Langberg
,
Alex Sprintson
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
On Minrank and Forbidden Subgraphs.
[BibTeX]
[DOI]
Ishay Haviv
ACM Trans. Comput. Theory, 2019

Sum-Free Sets of Integers with a Forbidden Sum.
[BibTeX]
[DOI]
Ishay Haviv
SIAM J. Discret. Math., 2019

Topological bounds on the dimension of orthogonal representations of graphs.
[BibTeX]
[DOI]
Ishay Haviv
Eur. J. Comb., 2019

H-wise Independence.
[BibTeX]
[DOI]
Ishay Haviv
,
Michael Langberg
Chic. J. Theor. Comput. Sci., 2019

Approximating the Orthogonality Dimension of Graphs and Hypergraphs.
[BibTeX]
[DOI]
Ishay Haviv
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
Dioid partitions of groups.
[BibTeX]
[DOI]
Ishay Haviv
,
Dan Levy
Eur. J. Comb., 2018

On Minrank and the Lovász Theta Function.
[BibTeX]
[DOI]
Ishay Haviv
Proceedings of the Approximation, 2018

2017
Symmetric Complete Sum-free Sets in Cyclic Groups.
[BibTeX]
[DOI]
Ishay Haviv
,
Dan Levy
Electron. Notes Discret. Math., 2017

Sunflowers and Testing Triangle-Freeness of Functions.
[BibTeX]
[DOI]
Ishay Haviv
,
Ning Xie
Comput. Complex., 2017

Non-linear cyclic codes that attain the Gilbert-Varshamov bound.
[BibTeX]
[DOI]
Ishay Haviv
,
Michael Langberg
,
Moshe Schwartz
,
Eitan Yaakobi
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
The List-Decoding Size of Fourier-Sparse Boolean Functions.
[BibTeX]
[DOI]
Ishay Haviv
,
Oded Regev
ACM Trans. Comput. Theory, 2016

The Restricted Isometry Property of Subsampled Fourier Matrices.
[BibTeX]
[DOI]
Ishay Haviv
,
Oded Regev
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
The remote set problem on lattices.
[BibTeX]
[DOI]
Ishay Haviv
Comput. Complex., 2015

2014
Linear Index Coding via Semidefinite Programming.
[BibTeX]
[DOI]
Eden Chlamtac
,
Ishay Haviv
Comb. Probab. Comput., 2014

On the Lattice Isomorphism Problem.
[BibTeX]
[DOI]
Ishay Haviv
,
Oded Regev
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2012
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors.
[BibTeX]
[DOI]
Ishay Haviv
,
Oded Regev
Theory Comput., 2012

Hardness of the Covering Radius Problem on Lattices.
[BibTeX]
[DOI]
Ishay Haviv
,
Oded Regev
Chic. J. Theor. Comput. Sci., 2012

On linear index coding for random graphs.
[BibTeX]
[DOI]
Ishay Haviv
,
Michael Langberg
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Lattices and codes
[BibTeX]
[DOI]
Ishay Haviv
PhD thesis, 2011

Beating the Gilbert-Varshamov bound for online channels.
[BibTeX]
[DOI]
Ishay Haviv
,
Michael Langberg
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
The Euclidean Distortion of Flat Tori.
[BibTeX]
[DOI]
Ishay Haviv
,
Oded Regev
Proceedings of the Approximation, 2010

2009
A Note on the Distribution of the Distance from a Lattice.
[BibTeX]
[DOI]
Ishay Haviv
,
Vadim Lyubashevsky
,
Oded Regev
Discret. Comput. Geom., 2009

2008
Rounding Parallel Repetitions of Unique Games.
[BibTeX]
[DOI]
Boaz Barak
,
Moritz Hardt
,
Ishay Haviv
,
Anup Rao
,
Oded Regev
,
David Steurer
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy.
[BibTeX]
[DOI]
Ishay Haviv
,
Oded Regev
,
Amnon Ta-Shma
Theory Comput., 2007


  Loading...