| Publication | Date of Publication | Type |
|---|
| Sliding window string indexing in streams | 2024-10-21 | Paper |
| New advances in rightmost Lempel-Ziv | 2024-05-29 | Paper |
| Lyndon Words Accelerate Suffix Sorting. | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6159890 | 2023-06-23 | Paper |
| Deterministic Sparse Suffix Sorting in the Restore Model | 2023-04-26 | Paper |
| Practical Performance of Space Efficient Data Structures for Longest Common Extensions. | 2023-02-07 | Paper |
| Practical Wavelet Tree Construction | 2022-09-06 | Paper |
| Engineering practical Lempel-Ziv tries | 2022-09-06 | Paper |
| Bidirectional Text Compression in External Memory | 2022-05-11 | Paper |
| Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries | 2021-02-16 | Paper |
| Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory | 2021-01-27 | Paper |
| Lempel-Ziv Compression in a Sliding Window | 2020-05-25 | Paper |
| Lightweight distributed suffix array construction | 2019-09-13 | Paper |
| Simple, Fast and Lightweight Parallel Wavelet Tree Construction | 2019-09-12 | Paper |
| Inducing suffix and LCP arrays in external memory | 2019-09-12 | Paper |
| Engineering a Distributed Full-Text Index | 2019-09-12 | Paper |
| High-order entropy compressed bit vectors with rank/select | 2019-03-26 | Paper |
| Sparse text indexing in small space | 2018-11-05 | Paper |
| Compression with the tudocomp framework | 2018-08-13 | Paper |
| Lempel-Ziv-78 compressed string dictionaries | 2018-07-25 | Paper |
| Lempel-Ziv factorization powered by space efficient suffix trees | 2018-07-25 | Paper |
| On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching | 2017-10-17 | Paper |
| Inducing suffix and LCP arrays in external memory | 2017-06-16 | Paper |
| Deterministic Sparse Suffix Sorting on Rewritable Texts | 2016-05-03 | Paper |
| Approximating LZ77 via Small-Space Multiple-Pattern Matching | 2015-11-19 | Paper |
| Alphabet-dependent string searching with wexponential search trees | 2015-08-20 | Paper |
| Lempel Ziv computation in small space (LZ-CISS) | 2015-08-20 | Paper |
| On (dynamic) range minimum queries in external memory | 2013-08-12 | Paper |
| Sparse suffix tree construction in small space | 2013-08-06 | Paper |
| LRM-trees: compressed indices, adaptive sorting, and compressed permutations | 2012-11-08 | Paper |
| Forbidden patterns | 2012-06-29 | Paper |
| Range median of minima queries, super-Cartesian trees, and text indexing | 2011-12-19 | Paper |
| Compact representation of posets | 2011-12-16 | Paper |
| Inducing the LCP-array | 2011-08-12 | Paper |
| Space-efficient preprocessing schemes for range minimum queries on static arrays | 2011-07-29 | Paper |
| LRM-trees: compressed indices, adaptive sorting, and compressed permutations | 2011-06-29 | Paper |
| Combined data structure for previous- and next-smaller-values | 2011-05-10 | Paper |
| Finding range minima in the middle: approximations and applications | 2011-02-19 | Paper |
| New common ancestor problems in trees and directed acyclic graphs | 2010-09-07 | Paper |
| Wee LCP | 2010-09-07 | Paper |
| Optimal succinctness for range minimum queries | 2010-04-27 | Paper |
| Faster entropy-bounded compressed suffix trees | 2009-11-18 | Paper |
| Short Labels for Lowest Common Ancestors in Trees | 2009-10-29 | Paper |
| A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array | 2009-03-03 | Paper |
| Data structures for efficient string algorithms. | 2008-08-20 | Paper |
| Two-Dimensional Range Minimum Queries | 2008-06-17 | Paper |
| Suffix Arrays on Words | 2008-06-17 | Paper |
| An(other) Entropy-Bounded Compressed Suffix Tree | 2008-06-17 | Paper |
| Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE | 2007-09-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
