| Publication | Date of Publication | Type |
|---|
| Faster block tree construction | 2025-01-06 | Paper |
| Acceleration of FM-index queries through prefix-free parsing | 2024-12-09 | Paper |
| Encoding hard string problems with answer set programming | 2024-10-21 | Paper |
| On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms | 2024-06-21 | Paper |
| Data structures for SMEM-finding in the PBWT | 2024-05-29 | Paper |
| Space-time trade-offs for the LCP array of Wheeler DFAs | 2024-05-29 | Paper |
| Compact data structures for shortest unique substring queries | 2024-04-19 | Paper |
| Constructing and indexing the bijective and extended Burrows-Wheeler transform | 2024-03-27 | Paper |
| Computing longest Lyndon subsequences and longest common Lyndon subsequences | 2024-03-25 | Paper |
| Computing the parameterized Burrows-Wheeler transform online | 2023-08-04 | Paper |
| Accessing the suffix array via \(\phi^{-1}\)-forest | 2023-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098777 | 2023-06-14 | Paper |
| Longest bordered and periodic subsequences | 2023-06-05 | Paper |
| Dynamic Path-decomposed Tries | 2023-05-23 | Paper |
| Deterministic Sparse Suffix Sorting in the Restore Model | 2023-04-26 | Paper |
| Fast and simple compact hashing via bucketing | 2023-02-07 | Paper |
| Space-efficient Huffman codes revisited | 2022-10-28 | Paper |
| Engineering Practical Lempel-Ziv Tries | 2022-09-06 | Paper |
| Computing longest (common) Lyndon subsequences | 2022-08-30 | Paper |
| Space-efficient B trees via load-balancing | 2022-08-30 | Paper |
| Fast and simple compact hashing via bucketing | 2022-08-18 | Paper |
| Indexing the bijective BWT | 2022-07-18 | Paper |
| Grammar index by induced suffix sorting | 2022-06-15 | Paper |
| Extracting the sparse longest common prefix array from the suffix binary search tree | 2022-06-15 | Paper |
| A separation of \(\gamma\) and \(b\) via Thue-Morse words | 2022-06-15 | Paper |
| c-trie++: a dynamic trie tailored for fast prefix searches | 2022-06-08 | Paper |
| Bidirectional Text Compression in External Memory | 2022-05-11 | Paper |
| Space-Efficient Huffman Codes Revisited | 2021-08-11 | Paper |
| On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms | 2021-07-06 | Paper |
| A Separation of $\gamma$ and $b$ via Thue--Morse Words | 2021-04-19 | Paper |
| Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries | 2021-02-16 | Paper |
| Space-efficient algorithms for computing minimal/shortest unique substrings | 2020-10-22 | Paper |
| Computational aspects of ordered integer partitions with bounds | 2020-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110887 | 2020-05-25 | Paper |
| Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes | 2018-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580160 | 2018-08-13 | Paper |
| Lempel-Ziv factorization powered by space efficient suffix trees | 2018-07-25 | Paper |
| Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets | 2018-03-01 | Paper |
| Efficiently Finding All Maximal alpha-gapped Repeats | 2018-01-24 | Paper |
| On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching | 2017-10-17 | Paper |
| Deterministic Sparse Suffix Sorting on Rewritable Texts | 2016-05-03 | Paper |
| Arithmetics on Suffix Arrays of Fibonacci Words | 2015-11-04 | Paper |
| Lempel Ziv Computation in Small Space (LZ-CISS) | 2015-08-20 | Paper |
| Structured Document Algebra in Action | 2015-06-22 | Paper |
| Pseudodifferentialoperatoren mit nichtglatten Koeffizienten auf Mannigfaltigkeiten | 2013-11-07 | Paper |
