Nicola Prezza

IEEE Trans. Inf. Theory, April, 2023

r-indexing without backward searching.

[BibT_eX]

[DOI]

CoRR, 2023

Sketching and Streaming for Dictionary Compression.

[BibT_eX]

[DOI]

CoRR, 2023

Random Wheeler Automata.

[BibT_eX]

[DOI]

CoRR, 2023

Algorithms for Massive Data - Lecture Notes.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2023

Optimal Wheeler Language Recognition.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2023

Testing Wheelerness of Regular Languages (short paper) (text not included).

[BibT_eX]

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

Sorting Finite Automata via Partition Refinement.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Computing matching statistics on Wheeler DFAs.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2023

Faster Prefix-Sorting Algorithms for Deterministic Finite Automata.

[BibT_eX]

[DOI]

Sung-Hwan Kim

Francisco Olivares

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Verifiable Learning for Robust Tree Ensembles.

[BibT_eX]

[DOI]

Stefano Calzavara

Lorenzo Cazzaro

Giulio Ermanno Pibiri

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022

Special Issue on Algorithms and Data-Structures for Compressed Computation.

[BibT_eX]

[DOI]

Algorithms, 2022

Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW).

[BibT_eX]

[DOI]

Algorithmica, 2022

HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances.

[BibT_eX]

[DOI]

Dominik Köppl

Proceedings of the Data Compression Conference, 2022

Linear-time Minimization of Wheeler DFAs.

[BibT_eX]

[DOI]

Jarno Alanko

Nicola Cotumaccio

Proceedings of the Data Compression Conference, 2022

2021

On the Approximation Ratio of Ordered Parsings.

[BibT_eX]

[DOI]

Carlos Ochoa

IEEE Trans. Inf. Theory, 2021

Space-efficient construction of compressed suffix trees.

[BibT_eX]

[DOI]

Giovanna Rosone

Theor. Comput. Sci., 2021

Adaptive learning of compressible strings.

[BibT_eX]

[DOI]

Gabriele Fici

Rossano Venturini

Theor. Comput. Sci., 2021

Optimal Substring Equality Queries with Applications to Sparse Text Indexing.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Optimal-Time Dictionary-Compressed Indexes.

[BibT_eX]

[DOI]

Anders Roy Christiansen

Mikko Berggren Ettienne

Tomasz Kociumaka

ACM Trans. Algorithms, 2021

Wheeler languages.

[BibT_eX]

[DOI]

Inf. Comput., 2021

On (co-lex) Ordering Automata.

[BibT_eX]

[DOI]

CoRR, 2021

Which Regular Languages can be Efficiently Indexed?

[BibT_eX]

[DOI]

CoRR, 2021

Subpath Queries on Compressed Graphs: A Survey.

[BibT_eX]

[DOI]

Algorithms, 2021

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

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

On Locating Paths in Compressed Tries.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

On Indexing and Compressing Finite Automata.

[BibT_eX]

[DOI]

Nicola Cotumaccio

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Compressed Weighted de Bruijn Graphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space.

[BibT_eX]

[DOI]

J. ACM, 2020

Substring Query Complexity of String Reconstruction.

[BibT_eX]

[DOI]

Gabriele Fici

Rossano Venturini

CoRR, 2020

On Locating Paths in Compressed Cardinal Trees.

[BibT_eX]

[DOI]

CoRR, 2020

Variable-order reference-free variant discovery with the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

BMC Bioinform., 2020

gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2020

Indexing Compressed Text: A Tale of Time and Space (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Regular Languages meet Prefix Sorting.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Towards a Definitive Measure of Repetitiveness.

[BibT_eX]

[DOI]

Tomasz Kociumaka

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Decompressing Lempel-Ziv Compressed Text.

[BibT_eX]

[DOI]

Mikko Berggren Ettienne

Proceedings of the Data Compression Conference, 2020

Faster Online Computation of the Succinct Longest Previous Factor Array.

[BibT_eX]

[DOI]

Giovanna Rosone

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Universal compressed text indexing.

[BibT_eX]

[DOI]

Miguel A. Martínez-Prieto

Theor. Comput. Sci., 2019

On the reproducibility of experiments of indexing repetitive document collections.

[BibT_eX]

[DOI]

Antonio Fariña

Inf. Syst., 2019

On Prefix-Sorting Finite Automata.

[BibT_eX]

[DOI]

Jarno Alanko

CoRR, 2019

SNPs detection by eBWT positional clustering.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2019

A New Linear-Time Algorithm for Centroid Decomposition.

[BibT_eX]

[DOI]

Davide Della Giustina

Rossano Venturini

Proceedings of the String Processing and Information Retrieval, 2019

Online Algorithms on Antipowers and Antiperiods.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Giovanna Rosone

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Optimal Rank and Select Queries on Dictionary-Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

A separation between RLSLPs and LZ77.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

Faster Attractor-Based Indexes.

[BibT_eX]

[DOI]

CoRR, 2018

On the Approximation Ratio of Greedy Parsings.

[BibT_eX]

[DOI]

CoRR, 2018

Fast Lempel-Ziv Decompression in Linear Space.

[BibT_eX]

[DOI]

Mikko Berggren Ettienne

CoRR, 2018

LZ77 Computation Based on the Run-Length Encoded BWT.

[BibT_eX]

[DOI]

Algorithmica, 2018

Detecting Mutations by eBWT.

[BibT_eX]

[DOI]

Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

At the roots of dictionary compression: string attractors.

[BibT_eX]

[DOI]

Dominik Kempa

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

In-Place Sparse Suffix Sorting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Optimal-Time Text Indexing in BWT-runs Bounded Space.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

On the Approximation Ratio of Lempel-Ziv Parsing.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

On String Attractors.

[BibT_eX]

[DOI]

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

String Attractors: Verification and Optimization.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Compressed Computation for Text Indexing.

[BibT_eX]

[DOI]

PhD thesis, 2017

A Separation Between Run-Length SLPs and LZ77.

[BibT_eX]

[DOI]

CoRR, 2017

Fast Locating with the RLBWT.

[BibT_eX]

[DOI]

CoRR, 2017

Practical and Effective Re-Pair Compression.

[BibT_eX]

[DOI]

CoRR, 2017

A Framework of Dynamic Data Structures for String Processing.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Succinct Partial Sums and Fenwick Trees.

[BibT_eX]

[DOI]

Anders Roy Christiansen

Frederik Rye Skjoldjensen

Proceedings of the String Processing and Information Retrieval, 2017

Space-Efficient Re-Pair Compression.

[BibT_eX]

[DOI]

Proceedings of the 2017 Data Compression Conference, 2017

From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Flexible Indexing of Repetitive Collections.

[BibT_eX]

[DOI]

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

In-Place Longest Common Extensions.

[BibT_eX]

[DOI]

CoRR, 2016

Fast Longest Common Extensions in Small Space.

[BibT_eX]

[DOI]

CoRR, 2016

Practical combinations of repetition-aware data structures.

[BibT_eX]

[DOI]

CoRR, 2016

Fast, accurate, and lightweight analysis of BS-treated reads with ERNE 2.

[BibT_eX]

[DOI]

BMC Bioinform., 2016

Computing LZ77 in Run-Compressed Space.

[BibT_eX]

[DOI]

Proceedings of the 2016 Data Compression Conference, 2016

2015

A Compressed-Gap Data-Aware Measure for Indexable Dictionaries.

[BibT_eX]

[DOI]

CoRR, 2015

Fast randomized approximate string matching with succinct hash data structures.

[BibT_eX]

[DOI]

BMC Bioinform., 2015

Fast Online Lempel-Ziv Factorization in Compressed Space.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Nicola Gigante

Proceedings of the Language and Automata Theory and Applications, 2015

Composite Repetition-Aware Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

Hashing and Indexing: Succinct DataStructures and Smoothed Analysis.

[BibT_eX]

[DOI]