| No. |
Title |
Author |
Year |
| 1 |
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata |
Kim, Sung-Hwan et al. |
2023 |
| 2 |
Sorting Finite Automata via Partition Refinement |
Becker, Ruben et al. |
2023 |
| 3 |
Compressed Weighted de Bruijn Graphs |
Italiano, Giuseppe F. et al. |
2021 |
| 4 |
Indexing Compressed Text: A Tale of Time and Space (Invited Talk) |
Prezza, Nicola |
2020 |
| 5 |
Optimal Rank and Select Queries on Dictionary-Compressed Text |
Prezza, Nicola |
2019 |
| 6 |
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform |
Prezza, Nicola et al. |
2019 |
| 7 |
Detecting Mutations by eBWT |
Prezza, Nicola et al. |
2018 |
| 8 |
String Attractors: Verification and Optimization |
Kempa, Dominik et al. |
2018 |
| 9 |
A Framework of Dynamic Data Structures for String Processing |
Prezza, Nicola |
2017 |
| 10 |
From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back |
Policriti, Alberto et al. |
2017 |
