| 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
Discrete Applied Mathematics | 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
Information and Computation | 2024-03-27 | Paper |
Computing longest Lyndon subsequences and longest common Lyndon subsequences
Algorithmica | 2024-03-25 | Paper |
Computing the parameterized Burrows-Wheeler transform online
String Processing and Information Retrieval | 2023-08-04 | Paper |
Accessing the suffix array via \(\phi^{-1}\)-forest
String Processing and Information Retrieval | 2023-08-04 | Paper |
scientific article; zbMATH DE number 7695993 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-14 | Paper |
Longest bordered and periodic subsequences
Information Processing Letters | 2023-06-05 | Paper |
Dynamic Path-decomposed Tries
ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
Deterministic Sparse Suffix Sorting in the Restore Model
ACM Transactions on Algorithms | 2023-04-26 | Paper |
| Fast and simple compact hashing via bucketing | 2023-02-07 | Paper |
Space-efficient Huffman codes revisited
Information Processing Letters | 2022-10-28 | Paper |
Engineering practical Lempel-Ziv tries
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Computing longest (common) Lyndon subsequences
(available as arXiv preprint) | 2022-08-30 | Paper |
| Space-efficient B trees via load-balancing | 2022-08-30 | Paper |
Fast and simple compact hashing via bucketing
Algorithmica | 2022-08-18 | Paper |
| Indexing the bijective BWT | 2022-07-18 | Paper |
Grammar index by induced suffix sorting
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2022-06-15 | Paper |
c-trie++: a dynamic trie tailored for fast prefix searches
Information and Computation | 2022-06-08 | Paper |
Bidirectional Text Compression in External Memory
(available as arXiv preprint) | 2022-05-11 | Paper |
Space-Efficient Huffman Codes Revisited
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2021-04-19 | Paper |
Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries
String Processing and Information Retrieval | 2021-02-16 | Paper |
Space-efficient algorithms for computing minimal/shortest unique substrings
Theoretical Computer Science | 2020-10-22 | Paper |
Computational aspects of ordered integer partitions with bounds
Algorithmica | 2020-10-12 | Paper |
Computing all distinct squares in linear time for integer alphabets
(available as arXiv preprint) | 2020-05-25 | Paper |
Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes
Theoretical Computer Science | 2018-11-29 | Paper |
Compression with the tudocomp framework
(available as arXiv preprint) | 2018-08-13 | Paper |
Lempel-Ziv factorization powered by space efficient suffix trees
Algorithmica | 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
Theory of Computing Systems | 2018-03-01 | Paper |
Efficiently finding all maximal \(\alpha\)-gapped repeats
(available as arXiv preprint) | 2018-01-24 | Paper |
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
(available as arXiv preprint) | 2017-10-17 | Paper |
Deterministic Sparse Suffix Sorting on Rewritable Texts
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Arithmetics on suffix arrays of Fibonacci words
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Lempel Ziv computation in small space (LZ-CISS)
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Structured document algebra in action
Software, Services, and Systems | 2015-06-22 | Paper |
| Pseudodifferentialoperatoren mit nichtglatten Koeffizienten auf Mannigfaltigkeiten | 2013-11-07 | Paper |
