Itai Boneh

activity

20192026

most citedOptimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs

1 citations · 2 across the 10 of their papers we have counts for

collaborators

Showing 2024 · cs.DSShow all

3 papers · 2 filters

cs.DS2024

Hamming Distance Oracle

Itai Boneh, Dvir Fried, Shay Golan +1

In this paper, we present and study the \emph{Hamming distance oracle problem}. In this problem, the task is to preprocess two strings $S$ and $T$ of lengths $n$ and $m$ , respectiv…

cs.DS2024

String 2-Covers with No Length Restrictions

Itai Boneh, Shay Golan, Arseny Shur

A $λ$ -cover of a string $S$ is a set of strings ${C_{i}}_{1}^{λ}$ such that every index in $S$ is contained in an occurrence of at least one string $C_{i}$ . The existence of a $1$ -cover…

cs.DS2024

Hairpin Completion Distance Lower Bound

Itai Boneh, Dvir Fried, Shay Golan +1

Hairpin completion, derived from the hairpin formation observed in DNA biochemistry, is an operation applied to strings, particularly useful in DNA computing. Conceptually, a right…