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

2 papers · 1 filter

cs.DS2021

Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time

Amihood Amir, Itai Boneh

The Suffix Array $S A_{S} [1 \dots n]$ of an $n$ -length string $S$ is a lexicographically sorted array of the suffixes of $S$ . The suffix array is one of the most well known and widely…

cs.DS2021

The k-mappability problem revisited

Amihood Amir, Itai Boneh, Eitan Kondratovsky

The $k$ -mappability problem has two integers parameters $m$ and $k$ . For every subword of size $m$ in a text $S$ , we wish to report the number of indices in $S$ in which the word o…