| Publication | Date of Publication | Type |
|---|
On the complexity of computing the co-lexicographic width of a regular language
Journal of Computer and System Sciences | 2026-03-12 | Paper |
| Universally Wheeler languages | 2026-02-10 | Paper |
| The rational construction of a Wheeler DFA | 2025-12-02 | Paper |
| Random Wheeler automata | 2025-12-02 | Paper |
| Computing the LCP array of a labeled graph | 2025-12-02 | Paper |
Co-lexicographically ordering automata and regular languages. I
Journal of the ACM | 2025-02-05 | Paper |
| Sorting finite automata via partition refinement | 2025-01-06 | Paper |
| Faster prefix-sorting algorithms for deterministic finite automata | 2024-10-21 | Paper |
| Optimal Wheeler language recognition | 2024-05-29 | Paper |
| Space-time trade-offs for the LCP array of Wheeler DFAs | 2024-05-29 | Paper |
| Online algorithms on antipowers and antiperiods | 2024-04-19 | Paper |
| A new linear-time algorithm for centroid decomposition | 2024-04-19 | Paper |
Toward a Definitive Compressibility Measure for Repetitive Sequences
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
scientific article; zbMATH DE number 7788385 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788491 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Compressed Weighted de Bruijn Graphs | 2023-06-14 | Paper |
| Faster online computation of the succinct longest previous factor array | 2022-12-16 | Paper |
| Towards a definitive measure of repetitiveness | 2022-10-13 | Paper |
Space-efficient computation of the LCP array from the Burrows-Wheeler transform
(available as arXiv preprint) | 2022-07-18 | Paper |
Optimal rank and select queries on dictionary-compressed text
(available as arXiv preprint) | 2022-07-18 | Paper |
Detecting mutations by eBWT
(available as arXiv preprint) | 2022-07-18 | Paper |
Novel results on the number of runs of the Burrows-Wheeler-transform
(available as arXiv preprint) | 2022-03-24 | Paper |
Optimal-Time Dictionary-Compressed Indexes
ACM Transactions on Algorithms | 2022-02-08 | Paper |
Optimal Substring Equality Queries with Applications to Sparse Text Indexing
ACM Transactions on Algorithms | 2022-02-08 | Paper |
Wheeler languages
Information and Computation | 2021-11-25 | Paper |
Adaptive learning of compressible strings
Theoretical Computer Science | 2021-11-18 | Paper |
scientific article; zbMATH DE number 7378722 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
On the Approximation Ratio of Ordered Parsings
IEEE Transactions on Information Theory | 2021-02-24 | Paper |
Succinct partial sums and Fenwick trees
String Processing and Information Retrieval | 2021-02-16 | Paper |
Regular Languages meet Prefix Sorting
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Space-efficient construction of compressed suffix trees
Theoretical Computer Science | 2021-01-25 | Paper |
Fully functional suffix trees and optimal text searching in BWT-runs bounded space
Journal of the ACM | 2020-11-11 | Paper |
From LZ77 to the run-length encoded Burrows-Wheeler transform, and back
(available as arXiv preprint) | 2020-05-25 | Paper |
| On the approximation ratio of Lempel-Ziv parsing | 2020-02-12 | Paper |
At the roots of dictionary compression: string attractors
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
At the roots of dictionary compression: string attractors
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Universal compressed text indexing
Theoretical Computer Science | 2019-02-28 | Paper |
A separation between RLSLPs and LZ77
Journal of Discrete Algorithms | 2018-12-14 | Paper |
A framework of dynamic data structures for string processing
(available as arXiv preprint) | 2018-08-13 | Paper |
LZ77 computation based on the run-length encoded BWT
Algorithmica | 2018-07-25 | Paper |
| scientific article; zbMATH DE number 6850405 (Why is no real title available?) | 2018-03-15 | Paper |
scientific article; zbMATH DE number 6850405 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-15 | Paper |
| In-place sparse suffix sorting | 2018-03-15 | Paper |
In-place sparse suffix sorting
(available as arXiv preprint) | 2018-03-15 | Paper |
| Flexible indexing of repetitive collections | 2017-08-04 | Paper |
Average linear time and compressed space construction of the Burrows-Wheeler transform
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Hashing and indexing: succinct data structures and smoothed analysis
Algorithms and Computation | 2015-09-11 | Paper |
Composite repetition-aware data structures
Combinatorial Pattern Matching | 2015-08-20 | Paper |
