ERNE-BS5: aligning BS-treated sequences by multiple hits on a 5-letters alphabet. - Nicola Prezza; Cristian Del Fabbro; Francesco Vezzi; Emanuale De Paoli; Alberto Policriti (BCB, 2012)

Hashing and Indexing: Succinct DataStructures and Smoothed Analysis. - Alberto Policriti; Nicola Prezza (ISAAC, 2014)

Composite Repetition-Aware Data Structures. - Djamal Belazzougui; Fabio Cunial; Travis Gagie; Nicola Prezza; Mathieu Raffinot (CPM, 2015)

Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform. - Alberto Policriti; Nicola Gigante; Nicola Prezza (LATA, 2015)

Fast Online Lempel-Ziv Factorization in Compressed Space. - Alberto Policriti; Nicola Prezza (SPIRE, 2015)

Fast randomized approximate string matching with succinct hash data structures. - Alberto Policriti; Nicola Prezza (BMC Bioinform., 2015)

A Compressed-Gap Data-Aware Measure for Indexable Dictionaries. - Nicola Prezza (CoRR, 2015)

Computing LZ77 in Run-Compressed Space. - Alberto Policriti; Nicola Prezza (DCC, 2016)

Fast, accurate, and lightweight analysis of BS-treated reads with ERNE 2. - Nicola Prezza; Francesco Vezzi; Max Käller; Alberto Policriti (BMC Bioinform., 2016)

Practical combinations of repetition-aware data structures. - Djamal Belazzougui; Fabio Cunial; Travis Gagie; Nicola Prezza; Mathieu Raffinot (CoRR, 2016)

Fast Longest Common Extensions in Small Space. - Alberto Policriti; Nicola Prezza (CoRR, 2016)

In-Place Longest Common Extensions. - Nicola Prezza (CoRR, 2016)

Flexible Indexing of Repetitive Collections. - Djamal Belazzougui; Fabio Cunial; Travis Gagie; Nicola Prezza; Mathieu Raffinot (CiE, 2017)

From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. - Alberto Policriti; Nicola Prezza (CPM, 2017)

Space-Efficient Re-Pair Compression. - Philip Bille; Inge Li Gørtz; Nicola Prezza (DCC, 2017)

Succinct Partial Sums and Fenwick Trees. - Philip Bille; Anders Roy Christiansen; Nicola Prezza; Frederik Rye Skjoldjensen (SPIRE, 2017)

A Framework of Dynamic Data Structures for String Processing. - Nicola Prezza (SEA, 2017)

Practical and Effective Re-Pair Compression. - Philip Bille; Inge Li Gørtz; Nicola Prezza (CoRR, 2017)

Fast Locating with the RLBWT. - Travis Gagie; Gonzalo Navarro 001; Nicola Prezza (CoRR, 2017)

A Separation Between Run-Length SLPs and LZ77. - Philip Bille; Travis Gagie; Inge Li Gørtz; Nicola Prezza (CoRR, 2017)

Compressed Computation for Text Indexing. - Nicola Prezza (2017)

String Attractors: Verification and Optimization. - Dominik Kempa; Alberto Policriti; Nicola Prezza; Eva Rotenberg (ESA, 2018)

On String Attractors. - Nicola Prezza (ICTCS, 2018)

On the Approximation Ratio of Lempel-Ziv Parsing. - Travis Gagie; Gonzalo Navarro 001; Nicola Prezza (LATIN, 2018)

Optimal-Time Text Indexing in BWT-runs Bounded Space. - Travis Gagie; Gonzalo Navarro 001; Nicola Prezza (SODA, 2018)

In-Place Sparse Suffix Sorting. - Nicola Prezza (SODA, 2018)

At the roots of dictionary compression: string attractors. - Dominik Kempa; Nicola Prezza (STOC, 2018)

Detecting Mutations by eBWT. - Nicola Prezza; Nadia Pisanti; Marinella Sciortino; Giovanna Rosone (WABI, 2018)

LZ77 Computation Based on the Run-Length Encoded BWT. - Alberto Policriti; Nicola Prezza (Algorithmica, 2018)

Fast Lempel-Ziv Decompression in Linear Space. - Philip Bille; Mikko Berggren Ettienne; Travis Gagie; Inge Li Gørtz; Nicola Prezza (CoRR, 2018)

On the Approximation Ratio of Greedy Parsings. - Gonzalo Navarro 001; Nicola Prezza (CoRR, 2018)

Faster Attractor-Based Indexes. - Gonzalo Navarro 001; Nicola Prezza (CoRR, 2018)

A separation between RLSLPs and LZ77. - Philip Bille; Travis Gagie; Inge Li Gørtz; Nicola Prezza (J. Discrete Algorithms, 2018)

Optimal Rank and Select Queries on Dictionary-Compressed Text. - Nicola Prezza (CPM, 2019)

Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform. - Nicola Prezza; Giovanna Rosone (CPM, 2019)

Online Algorithms on Antipowers and Antiperiods. - Mai Alzamel; Alessio Conte; Daniele Greco; Veronica Guerrini; Costas S. Iliopoulos; Nadia Pisanti; Nicola Prezza; Giulia Punzi; Giovanna Rosone (SPIRE, 2019)

A New Linear-Time Algorithm for Centroid Decomposition. - Davide Della Giustina; Nicola Prezza; Rossano Venturini (SPIRE, 2019)

SNPs detection by eBWT positional clustering. - Nicola Prezza; Nadia Pisanti; Marinella Sciortino; Giovanna Rosone (Algorithms Mol. Biol., 2019)

On Prefix-Sorting Finite Automata. - Jarno Alanko; Alberto Policriti; Nicola Prezza (CoRR, 2019)

On the reproducibility of experiments of indexing repetitive document collections. - Antonio Fariña; Miguel A. Martínez-Prieto; Francisco Claude; Gonzalo Navarro 001; Juan J. Lastra-Díaz; Nicola Prezza; Diego Seco (Inf. Syst., 2019)

Universal compressed text indexing. - Gonzalo Navarro 001; Nicola Prezza (Theor. Comput. Sci., 2019)

Faster Online Computation of the Succinct Longest Previous Factor Array. - Nicola Prezza; Giovanna Rosone (CiE, 2020)

Decompressing Lempel-Ziv Compressed Text. - Philip Bille; Mikko Berggren Ettienne; Travis Gagie; Inge Li Gørtz; Nicola Prezza (DCC, 2020)

Towards a Definitive Measure of Repetitiveness. - Tomasz Kociumaka; Gonzalo Navarro 001; Nicola Prezza (LATIN, 2020)

Regular Languages meet Prefix Sorting. - Jarno Alanko; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (SODA, 2020)

Indexing Compressed Text: A Tale of Time and Space (Invited Talk). - Nicola Prezza (SEA, 2020)

gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. - Felipe A. Louza; Guilherme P. Telles; Simon Gog; Nicola Prezza; Giovanna Rosone (Algorithms Mol. Biol., 2020)

Variable-order reference-free variant discovery with the Burrows-Wheeler Transform. - Nicola Prezza; Nadia Pisanti; Marinella Sciortino; Giovanna Rosone (BMC Bioinform., 2020)

On Locating Paths in Compressed Cardinal Trees. - Nicola Prezza (CoRR, 2020)

Substring Query Complexity of String Reconstruction. - Gabriele Fici; Nicola Prezza; Rossano Venturini (CoRR, 2020)

Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space. - Travis Gagie; Gonzalo Navarro 001; Nicola Prezza (J. ACM, 2020)

Compressed Weighted de Bruijn Graphs. - Giuseppe F. Italiano; Nicola Prezza; Blerina Sinaimeri; Rossano Venturini (CPM, 2021)

On Indexing and Compressing Finite Automata. - Nicola Cotumaccio; Nicola Prezza (SODA, 2021)

On Locating Paths in Compressed Tries. - Nicola Prezza (SODA, 2021)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. - Sara Giuliani; Shunsuke Inenaga; Zsuzsanna Lipták; Nicola Prezza; Marinella Sciortino; Anna Toffanello (SOFSEM, 2021)

Subpath Queries on Compressed Graphs: A Survey. - Nicola Prezza (Algorithms, 2021)

Which Regular Languages can be Efficiently Indexed? - Nicola Cotumaccio; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (CoRR, 2021)

On (co-lex) Ordering Automata. - Giovanna D'Agostino; Nicola Cotumaccio; Alberto Policriti; Nicola Prezza (CoRR, 2021)

Wheeler languages. - Jarno Alanko; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (Inf. Comput., 2021)

Optimal-Time Dictionary-Compressed Indexes. - Anders Roy Christiansen; Mikko Berggren Ettienne; Tomasz Kociumaka; Gonzalo Navarro 001; Nicola Prezza (ACM Trans. Algorithms, 2021)

Optimal Substring Equality Queries with Applications to Sparse Text Indexing. - Nicola Prezza (ACM Trans. Algorithms, 2021)

Adaptive learning of compressible strings. - Gabriele Fici; Nicola Prezza; Rossano Venturini (Theor. Comput. Sci., 2021)

Space-efficient construction of compressed suffix trees. - Nicola Prezza; Giovanna Rosone (Theor. Comput. Sci., 2021)

On the Approximation Ratio of Ordered Parsings. - Gonzalo Navarro 001; Carlos Ochoa; Nicola Prezza (IEEE Trans. Inf. Theory, 2021)

Linear-time Minimization of Wheeler DFAs. - Jarno Alanko; Nicola Cotumaccio; Nicola Prezza (DCC, 2022)

HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. - Dominik Köppl; Gonzalo Navarro 001; Nicola Prezza (DCC, 2022)

Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW). - Mai Alzamel; Costas S. Iliopoulos; Dimitrios Letsios; Nicola Prezza (Algorithmica, 2022)

Special Issue on Algorithms and Data-Structures for Compressed Computation. - Alberto Policriti; Nicola Prezza (Algorithms, 2022)

Verifiable Learning for Robust Tree Ensembles. - Stefano Calzavara; Lorenzo Cazzaro; Giulio Ermanno Pibiri; Nicola Prezza (CCS, 2023)

Faster Prefix-Sorting Algorithms for Deterministic Finite Automata. - Sung-Hwan Kim; Francisco Olivares; Nicola Prezza (CPM, 2023)

Computing matching statistics on Wheeler DFAs. - Alessio Conte; Nicola Cotumaccio; Travis Gagie; Giovanni Manzini; Nicola Prezza; Marinella Sciortino (DCC, 2023)

Sorting Finite Automata via Partition Refinement. - Ruben Becker; Manuel Cáceres; Davide Cenzato; Sung-Hwan Kim; Bojana Kodric; Francisco Olivares; Nicola Prezza (ESA, 2023)

Testing Wheelerness of Regular Languages (short paper) (text not included). - Ruben Becker; Davide Cenzato; Sung-Hwan Kim; Bojana Kodric; Alberto Policriti; Nicola Prezza (ICTCS, 2023)

Optimal Wheeler Language Recognition. - Ruben Becker; Davide Cenzato; Sung-Hwan Kim; Bojana Kodric; Alberto Policriti; Nicola Prezza (SPIRE, 2023)

Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. - Nicola Cotumaccio; Travis Gagie; Dominik Köppl; Nicola Prezza (SPIRE, 2023)

Algorithms for Massive Data - Lecture Notes. - Nicola Prezza (CoRR, 2023)

Suffixient Sets. - Lore Depuydt; Travis Gagie; Ben Langmead; Giovanni Manzini; Nicola Prezza (CoRR, 2023)

Toward a Definitive Compressibility Measure for Repetitive Sequences. - Tomasz Kociumaka; Gonzalo Navarro 001; Nicola Prezza (IEEE Trans. Inf. Theory, 2023)

Co-lexicographically Ordering Automata and Regular Languages - Part I. - Nicola Cotumaccio; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (J. ACM, 2023)

Computing the LCP Array of a Labeled Graph. - Jarno N. Alanko; Davide Cenzato; Nicola Cotumaccio; Sung-Hwan Kim; Giovanni Manzini; Nicola Prezza (CPM, 2024)

Random Wheeler Automata. - Ruben Becker; Davide Cenzato; Sung-Hwan Kim; Bojana Kodric; Riccardo Maso; Nicola Prezza (CPM, 2024)

The Rational Construction of a Wheeler DFA. - Giovanni Manzini; Alberto Policriti; Nicola Prezza; Brian Riccardi (CPM, 2024)

Sketching and Streaming for Dictionary Compression. - Ruben Becker; Matteo Canton; Davide Cenzato; Sung-Hwan Kim; Bojana Kodric; Nicola Prezza (DCC, 2024)

Indexing Finite-State Automata Using Forward-Stable Partitions. - Ruben Becker; Sung-Hwan Kim; Nicola Prezza; Carlo Tosoni (SPIRE, 2024)

On Computing the Smallest Suffixient Set. - Davide Cenzato; Francisco Olivares; Nicola Prezza (SPIRE, 2024)

Top- k Frequent Patterns in Streams and Parameterized-Space LZ Compression. - Patrick Dinklage; Johannes Fischer 001; Nicola Prezza (SEA, 2024)

On the Complexity of Computing the Co-lexicographic Width of a Regular Language. - Ruben Becker; Davide Cenzato; Sung-Hwan Kim; Tomasz Kociumaka; Bojana Kodric; Alberto Policriti; Nicola Prezza (CoRR, 2024)

Regular Expressions: Matching and Indexing (Dagstuhl Seminar 24472). - Inge Li Gørtz; Sebastian Maneth; Gonzalo Navarro 001; Nicola Prezza (Dagstuhl Reports, 2024)

Wheeler Graphs and Wheeler Languages. - Nicola Cotumaccio; Giovanna D'Agostino; Daniel Gibney; Alberto Policriti; Nicola Prezza; Sharma V. Thankachan (The Expanding World of Compressed Data, 2025)

The Trie Measure, Revisited. - Jarno N. Alanko; Ruben Becker; Davide Cenzato; Travis Gagie; Sung-Hwan Kim; Bojana Kodric; Nicola Prezza (CPM, 2025)

Text Indexing for Simple Regular Expressions. - Hideo Bannai; Philip Bille; Inge Li Gørtz; Gad M. Landau; Gonzalo Navarro 001; Nicola Prezza; Teresa Anna Steiner; Simon Rumle Tarnow (CPM, 2025)

Encoding Co-Lex Orders of Finite-State Automata in Linear Space. - Ruben Becker; Nicola Cotumaccio; Sung-Hwan Kim; Nicola Prezza; Carlo Tosoni (CPM, 2025)

Universally Wheeler Languages. - Ruben Becker; Giuseppa Castiglione; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza; Antonio Restivo; Brian Riccardi (DLT, 2025)

Preface to "Computation over Compressed Data" at DCC 2022. - Travis Gagie; Nicola Prezza (Inf. Comput., 2025)

Testing Suffixient Sets. - Davide Cenzato; Francisco Olivares; Nicola Prezza (CoRR, 2025)

Compressing Suffix Trees by Path Decompositions. - Ruben Becker; Davide Cenzato; Travis Gagie; Sung-Hwan Kim; Ragnar Groot Koerkamp; Giovanni Manzini; Nicola Prezza (CoRR, 2025)