30 citations · 82 across the 38 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.DS2012
Optimal Dynamic Sequence Representations
Gonzalo Navarro, Yakov Nekrich
We describe a data structure that supports access, rank and select queries, as well as symbol insertions and deletions, on a string over alphabet in time $O(\lg n…
cs.DS2012★ 10 cited
Sorted Range Reporting
Yakov Nekrich, Gonzalo Navarro
In this paper we consider a variant of the orthogonal range reporting problem when all points should be reported in the sorted order of their -coordinates. We show that reportin…
cs.DS2012★ 5 cited
Cross-Document Pattern Matching
Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
We study a new variant of the string matching problem called cross-document string matching, which is the problem of indexing a collection of documents to support an efficient sear…