Dominik Köppl

Lempel Ziv Computation in Small Space (LZ-CISS)

For both the Lempel Ziv 77- and 78-factorization we propose factorization algorithms using \((1+\epsilon ) n \lg n + \mathop {}\mathopen {}\mathcal {O}\mathopen {}\left( n\right) \) bits (for any positive constant \(\epsilon \le 1\)) working space (including the space for the output) for any text of size \(n\) over an integer alphabet in \(\mathop {}\mathopen {}\mathcal {O}\mathopen {}\left( n / \epsilon ^{2}\right) \) time.

Efficiently Finding All Maximal alpha-gapped Repeats.

For

Lempel-Ziv Computation in Compressed Space (LZ-CICS)

\alpha\geq 1

Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes: Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets

, an

Deterministic Sparse Suffix Sorting on Rewritable Texts

\alpha

Structured document algebra in action

-gapped repeat in a word

Computing all distinct squares in linear time for integer alphabets

w

Improved upper bounds on all maximal α-gapped repeats and palindromes

is a factor

Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees

uvu

Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries

of