Ishay Haviv - RankMe

102 papers A* 8A 9B 10C 1Journal 68Unranked 5

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