On Locating Paths in Compressed Tries

von Prezza, Nicola
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 1 of 4 (2021)

Faster Online Computation of the Succinct Longest Previous Factor Array

von Prezza, Nicola
Veröffentlicht in CiE (16. : 2020 : Online) Beyond the horizon of computability (2020)

On Indexing and Compressing Finite Automata

von Cotumaccio, Nicola
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 4 of 4 (2021)

Towards a Definitive Measure of Repetitiveness

von Kociumaka, Tomasz
Veröffentlicht in LATIN (14. : 2020 : Online) LATIN 2020: theoretical informatics (2020)

Space-Time Trade-Offs for the LCP Array of Wheeler DFAs

von Cotumaccio, Nicola
Veröffentlicht in SPIRE (30. : 2023 : Pisa) String processing and information retrieval (2023)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform

von Giuliani, Sara
Veröffentlicht in SOFSEM (47. : 2021 : Online) SOFSEM 2021: theory and practice of computer science (2021)

Optimal Wheeler Language Recognition

von Becker, Ruben
Veröffentlicht in SPIRE (30. : 2023 : Pisa) String processing and information retrieval (2023)