I. Haviv

activity

20112026

most citedTensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors

48 citations · 68 across the 25 of their papers we have counts for

collaborators

Showing 2024Show all

5 papers · 1 filter

cs.DS2024

Improved Approximation Algorithms for Index Coding

Dror Chawin, Ishay Haviv

The index coding problem is concerned with broadcasting encoded information to a collection of receivers in a way that enables each receiver to discover its required data based on…

cs.DS2024

Kernelization for Orthogonality Dimension

Ishay Haviv, Dror Rabinovich

The orthogonality dimension of a graph over $R$ is the smallest integer $d$ for which one can assign to every vertex a nonzero vector in $R^{d}$ such that every two…

cs.DS2024

Testing Intersectingness of Uniform Families

Ishay Haviv, Michal Parnas

A set family $F$ is called intersecting if every two members of $F$ intersect, and it is called uniform if all members of $F$ share a common size. A uniform fa…

math.CO2024

Larger Nearly Orthogonal Sets over Finite Fields

Ishay Haviv, Sam Mattheus, Aleksa Milojević +1

For a field $F$ and integers $d$ and $k$ , a set $A \subseteq F^{d}$ is called $k$ -nearly orthogonal if its members are non-self-orthogonal and every $k + 1$ ve…

cs.CG2024

Nearly Orthogonal Sets over Finite Fields

Dror Chawin, Ishay Haviv

For a field $F$ and integers $d$ and $k$ , a set of vectors of $F^{d}$ is called $k$ -nearly orthogonal if its members are non-self-orthogonal and every $k + 1$ of them…