11 citations · 20 across the 20 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DS2015
Lempel-Ziv Computation In Compressed Space (LZ-CICS)
Dominik Köppl, Kunihiko Sadakane
We show that both the Lempel Ziv 77- and the 78-factorization of a text of length on an integer alphabet of size can be computed in time (linear time if we…
cs.DS2015
Efficiently Finding All Maximal -gapped Repeats
Paweł Gawrychowski, Tomohiro I, Shunsuke Inenaga +2
For , an -gapped repeat in a word is a factor of such that ; the two factors in such a repeat are called arms, while the factor is…
cs.DS2015
Deterministic Sparse Suffix Sorting in the Restore Model
Johannes Fischer, Tomohiro I, Dominik Köppl
Given a text of length , we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of in $O(c \sqrt{\lg n}…