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 2020Show all

3 papers · 1 filter

cs.CC2020

The Complexity of Finding Fair Independent Sets in Cycles

Ishay Haviv

Let $G$ be a cycle graph and let $V_{1}, \dots, V_{m}$ be a partition of its vertex set into $m$ sets. An independent set $S$ of $G$ is said to fairly represent the partition if $|S \ca…

cs.IT2020

Minimizing the alphabet size of erasure codes with restricted decoding sets

Mira Gonen, Ishay Haviv, Michael Langberg +1

A Maximum Distance Separable code over an alphabet $F$ is defined via an encoding function $C : F^{k} \to F^{n}$ that allows to retrieve a message $m \in F^{k}$ from the codeword $…

cs.CC2020

The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications

Alexander Golovnev, Ishay Haviv

The orthogonality dimension of a graph $G = (V, E)$ over a field $F$ is the smallest integer $t$ for which there exists an assignment of a vector $u_{v} \in F^{t}$ with…