default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIshay Haviv
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j28]Ishay Haviv, Sam Mattheus, Aleksa Milojevic, Yuval Wigderson:
Larger nearly orthogonal sets over finite fields. Discret. Math. 348(4): 114373 (2025)- 2024
- [j27]Ishay Haviv:
On Finding Constrained Independent Sets in Cycles. Algorithmica 86(4): 1006-1030 (2024) - [j26]Ishay Haviv
:
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems. SIAM J. Comput. 53(2): 287-314 (2024) - [j25]Dror Chawin, Ishay Haviv:
Hardness of Linear Index Coding on Perturbed Instances. IEEE Trans. Inf. Theory 70(2): 1388-1396 (2024) - [j24]Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson:
Minimizing the Alphabet Size in Codes With Restricted Error Sets. IEEE Trans. Inf. Theory 70(6): 3891-3902 (2024) - [j23]Dror Chawin, Ishay Haviv:
Improved Approximation Algorithms for Index Coding. IEEE Trans. Inf. Theory 70(11): 8266-8275 (2024) - [c31]Ishay Haviv, Michal Parnas:
Testing Intersectingness of Uniform Families. APPROX/RANDOM 2024: 35:1-35:15 - [c30]Dror Chawin, Ishay Haviv:
Nearly Orthogonal Sets over Finite Fields. SoCG 2024: 39:1-39:11 - [c29]Ishay Haviv:
The Chromatic Number of Kneser Hypergraphs via Consensus Division. ITCS 2024: 60:1-60:17 - [c28]Ishay Haviv, Dror Rabinovich:
Kernelization for Orthogonality Dimension. IPEC 2024: 8:1-8:17 - [i31]Dror Chawin, Ishay Haviv:
Nearly Orthogonal Sets over Finite Fields. CoRR abs/2402.08274 (2024) - [i30]Ishay Haviv, Sam Mattheus, Aleksa Milojevic, Yuval Wigderson:
Larger Nearly Orthogonal Sets over Finite Fields. CoRR abs/2404.01057 (2024) - [i29]Ishay Haviv, Michal Parnas:
Testing Intersectingness of Uniform Families. CoRR abs/2404.11504 (2024) - [i28]Ishay Haviv, Dror Rabinovich:
Kernelization for Orthogonality Dimension. CoRR abs/2408.08380 (2024) - [i27]Dror Chawin, Ishay Haviv:
Improved Approximation Algorithms for Index Coding. CoRR abs/2408.08382 (2024) - 2023
- [j22]Ishay Haviv, Michal Parnas:
On the binary and Boolean rank of regular matrices. J. Comput. Syst. Sci. 134: 73-86 (2023) - [j21]Inon Attias, Ishay Haviv:
Local orthogonality dimension. J. Graph Theory 104(2): 387-419 (2023) - [j20]Dror Chawin, Ishay Haviv:
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. SIAM J. Discret. Math. 37(4): 2670-2688 (2023) - [c27]Ishay Haviv:
On Finding Constrained Independent Sets in Cycles. ICALP 2023: 73:1-73:16 - [c26]Dror Chawin, Ishay Haviv:
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. STACS 2023: 20:1-20:14 - [i26]Dror Chawin, Ishay Haviv:
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. CoRR abs/2301.00732 (2023) - [i25]Ishay Haviv:
On Finding Constrained Independent Sets in Cycles. CoRR abs/2307.00317 (2023) - [i24]Ishay Haviv:
The Chromatic Number of Kneser Hypergraphs via Consensus Division. CoRR abs/2311.09016 (2023) - 2022
- [j19]Ishay Haviv:
The Complexity of Finding Fair Independent Sets in Cycles. Comput. Complex. 31(2): 14 (2022) - [j18]Dror Chawin, Ishay Haviv:
On the Subspace Choosability in Graphs. Electron. J. Comb. 29(2) (2022) - [j17]Ishay Haviv, Michal Parnas:
Upper bounds on the Boolean rank of Kronecker products. Discret. Appl. Math. 318: 82-96 (2022) - [j16]Alexander Golovnev, Ishay Haviv:
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. Adv. Math. Commun. 18: 1-22 (2022) - [c25]Dror Chawin, Ishay Haviv:
Hardness of Linear Index Coding on Perturbed Instances. Allerton 2022: 1-7 - [c24]Ishay Haviv:
A Fixed-Parameter Algorithm for the Kneser Problem. ICALP 2022: 72:1-72:18 - [c23]Ishay Haviv:
A Fixed-Parameter Algorithm for the Schrijver Problem. IPEC 2022: 16:1-16:16 - [c22]Ishay Haviv, Michal Parnas:
On the Binary and Boolean Rank of Regular Matrices. MFCS 2022: 56:1-56:14 - [i23]Ishay Haviv, Michal Parnas:
On the Binary and Boolean Rank of Regular Matrices. CoRR abs/2203.13073 (2022) - [i22]Ishay Haviv:
A Fixed-Parameter Algorithm for the Kneser Problem. CoRR abs/2204.06761 (2022) - [i21]Ishay Haviv, Michal Parnas:
The Binary Rank of Circulant Block Matrices. CoRR abs/2204.08942 (2022) - [i20]Ishay Haviv:
A Fixed-Parameter Algorithm for the Schrijver Problem. CoRR abs/2204.09009 (2022) - 2021
- [c21]Alexander Golovnev, Ishay Haviv:
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. CCC 2021: 8:1-8:15 - [c20]Ishay Haviv:
The Complexity of Finding Fair Independent Sets in Cycles. ITCS 2021: 4:1-4:14 - [c19]Ishay Haviv, Michal Parnas:
Upper Bounds on the Boolean Rank of Kronecker Products. LAGOS 2021: 172-180 - [i19]Inon Attias, Ishay Haviv:
Local Orthogonality Dimension. CoRR abs/2110.00718 (2021) - 2020
- [j15]Ishay Haviv:
Task-Based Solutions to Embedded Index Coding. IEEE Trans. Inf. Theory 66(10): 6144-6149 (2020) - [c18]Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson:
Minimizing the alphabet size of erasure codes with restricted decoding sets. ISIT 2020: 144-149 - [i18]Alexander Golovnev, Ishay Haviv:
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. CoRR abs/2002.08580 (2020) - [i17]Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson:
Minimizing the alphabet size of erasure codes with restricted decoding sets. CoRR abs/2005.06947 (2020) - [i16]Ishay Haviv:
The Complexity of Finding Fair Independent Sets in Cycles. CoRR abs/2011.01770 (2020)
2010 – 2019
- 2019
- [j14]Ishay Haviv, Michael Langberg:
H-wise Independence. Chic. J. Theor. Comput. Sci. 2019 (2019) - [j13]Ishay Haviv:
Topological bounds on the dimension of orthogonal representations of graphs. Eur. J. Comb. 81: 84-97 (2019) - [j12]Ishay Haviv:
Sum-Free Sets of Integers with a Forbidden Sum. SIAM J. Discret. Math. 33(1): 402-424 (2019) - [j11]Ishay Haviv:
On Minrank and Forbidden Subgraphs. ACM Trans. Comput. Theory 11(4): 20:1-20:13 (2019) - [c17]Ishay Haviv:
Approximating the Orthogonality Dimension of Graphs and Hypergraphs. MFCS 2019: 39:1-39:15 - [i15]Ishay Haviv:
Approximating the Orthogonality Dimension of Graphs and Hypergraphs. CoRR abs/1906.05005 (2019) - [i14]Ishay Haviv:
Task-based Solutions to Embedded Index Coding. CoRR abs/1906.09794 (2019) - 2018
- [j10]Ishay Haviv, Dan Levy:
Dioid partitions of groups. Eur. J. Comb. 73: 211-230 (2018) - [c16]Ishay Haviv:
On Minrank and the Lovász Theta Function. APPROX-RANDOM 2018: 13:1-13:15 - [c15]Ishay Haviv:
On Minrank and Forbidden Subgraphs. APPROX-RANDOM 2018: 42:1-42:14 - [i13]Ishay Haviv:
On Minrank and the Lovász Theta Function. CoRR abs/1802.03920 (2018) - [i12]Ishay Haviv:
On Minrank and Forbidden Subgraphs. CoRR abs/1806.00638 (2018) - [i11]Ishay Haviv, Oded Regev, Amnon Ta-Shma:
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. CoRR abs/1806.04080 (2018) - [i10]Ishay Haviv, Oded Regev:
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors. CoRR abs/1806.04087 (2018) - [i9]Ishay Haviv:
Topological Bounds on the Dimension of Orthogonal Representations of Graphs. CoRR abs/1811.11488 (2018) - 2017
- [j9]Ishay Haviv, Ning Xie:
Sunflowers and Testing Triangle-Freeness of Functions. Comput. Complex. 26(2): 497-530 (2017) - [j8]Ishay Haviv, Dan Levy:
Symmetric Complete Sum-free Sets in Cyclic Groups. Electron. Notes Discret. Math. 61: 585-591 (2017) - [c14]Ishay Haviv, Michael Langberg, Moshe Schwartz, Eitan Yaakobi:
Non-linear cyclic codes that attain the Gilbert-Varshamov bound. ISIT 2017: 586-588 - [i8]Ishay Haviv, Michael Langberg, Moshe Schwartz, Eitan Yaakobi:
Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound. CoRR abs/1701.01043 (2017) - 2016
- [j7]Ishay Haviv, Oded Regev:
The List-Decoding Size of Fourier-Sparse Boolean Functions. ACM Trans. Comput. Theory 8(3): 10:1-10:14 (2016) - [c13]Ishay Haviv, Oded Regev:
The Restricted Isometry Property of Subsampled Fourier Matrices. SODA 2016: 288-297 - 2015
- [j6]Ishay Haviv:
The remote set problem on lattices. Comput. Complex. 24(1): 103-131 (2015) - [c12]Ishay Haviv, Oded Regev:
The List-Decoding Size of Fourier-Sparse Boolean Functions. CCC 2015: 58-71 - [c11]Ishay Haviv, Ning Xie:
Sunflowers and Testing Triangle-Freeness of Functions. ITCS 2015: 357-366 - [i7]Ishay Haviv, Oded Regev:
The List-Decoding Size of Fourier-Sparse Boolean Functions. CoRR abs/1504.01649 (2015) - [i6]Ishay Haviv, Oded Regev:
The Restricted Isometry Property of Subsampled Fourier Matrices. CoRR abs/1507.01768 (2015) - 2014
- [j5]Eden Chlamtac, Ishay Haviv:
Linear Index Coding via Semidefinite Programming. Comb. Probab. Comput. 23(2): 223-247 (2014) - [c10]Ishay Haviv, Oded Regev:
On the Lattice Isomorphism Problem. SODA 2014: 391-404 - [i5]Ishay Haviv, Ning Xie:
Sunflowers and Testing Triangle-Freeness of Functions. CoRR abs/1411.4692 (2014) - 2013
- [c9]Ishay Haviv, Michael Langberg:
H-wise independence. ITCS 2013: 541-552 - [i4]Ishay Haviv, Oded Regev:
On the Lattice Isomorphism Problem. CoRR abs/1311.0366 (2013) - 2012
- [j4]Ishay Haviv, Oded Regev:
Hardness of the Covering Radius Problem on Lattices. Chic. J. Theor. Comput. Sci. 2012 (2012) - [j3]Ishay Haviv, Oded Regev:
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors. Theory Comput. 8(1): 513-531 (2012) - [c8]Ishay Haviv:
The Remote Set Problem on Lattices. APPROX-RANDOM 2012: 182-193 - [c7]Ishay Haviv, Michael Langberg:
On linear index coding for random graphs. ISIT 2012: 2231-2235 - [c6]Eden Chlamtac, Ishay Haviv:
Linear index coding via semidefinite programming. SODA 2012: 406-419 - 2011
- [b1]Ishay Haviv:
Lattices and codes. Tel Aviv University, Israel, 2011 - [c5]Ishay Haviv, Michael Langberg:
Beating the Gilbert-Varshamov bound for online channels. ISIT 2011: 1392-1396 - [i3]Ishay Haviv, Michael Langberg:
Beating the Gilbert-Varshamov Bound for Online Channels. CoRR abs/1101.1045 (2011) - [i2]Ishay Haviv, Michael Langberg:
On Linear Index Coding for Random Graphs. CoRR abs/1107.0390 (2011) - [i1]Eden Chlamtac, Ishay Haviv:
Linear Index Coding via Semidefinite Programming. CoRR abs/1107.1958 (2011) - 2010
- [c4]Ishay Haviv, Oded Regev:
The Euclidean Distortion of Flat Tori. APPROX-RANDOM 2010: 232-245
2000 – 2009
- 2009
- [j2]Ishay Haviv, Vadim Lyubashevsky, Oded Regev:
A Note on the Distribution of the Distance from a Lattice. Discret. Comput. Geom. 41(1): 162-176 (2009) - 2008
- [c3]Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer:
Rounding Parallel Repetitions of Unique Games. FOCS 2008: 374-383 - 2007
- [j1]Ishay Haviv, Oded Regev, Amnon Ta-Shma:
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. Theory Comput. 3(1): 45-60 (2007) - [c2]Ishay Haviv, Oded Regev:
Tensor-based hardness of the shortest vector problem to within almost polynomial factors. STOC 2007: 469-477 - 2006
- [c1]Ishay Haviv, Oded Regev:
Hardness of the Covering Radius Problem on Lattices. CCC 2006: 145-158
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
