Nicola Prezza

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 118

Top Venues

Publications

Patrick Dinklage, Johannes Fischer, Nicola Prezza
Top- k Frequent Patterns in Streams and Parameterized-Space LZ Compression. SEA (2024)
Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza
Sketching and Streaming for Dictionary Compression. DCC (2024)
Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza
Random Wheeler Automata. CPM (2024)
Davide Cenzato, Francisco Olivares, Nicola Prezza
On Computing the Smallest Suffixient Set. CoRR (2024)
Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni
Indexing Finite-State Automata Using Forward-Stable Partitions. CoRR (2024)
Jarno Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza
Computing the LCP Array of a Labeled Graph. CoRR (2024)
Giovanni Manzini, Alberto Policriti, Nicola Prezza, Brian Riccardi
The Rational Construction of a Wheeler DFA. CPM (2024)
Jarno N. Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza
Computing the LCP Array of a Labeled Graph. CPM (2024)
Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza
Sketching and Streaming for Dictionary Compression. CoRR (2023)
Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza
Optimal Wheeler Language Recognition. CoRR (2023)
Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza
Optimal Wheeler Language Recognition. SPIRE (2023)
Sung-Hwan Kim, Francisco Olivares, Nicola Prezza
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata. CPM (2023)
Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza
Space-time Trade-offs for the LCP Array of Wheeler DFAs. CoRR (2023)
Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino
Computing matching statistics on Wheeler DFAs. DCC (2023)
Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza
Testing Wheelerness of Regular Languages (short paper) (text not included). ICTCS (2023)
Sung-Hwan Kim, Francisco Olivares, Nicola Prezza
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata. CoRR (2023)
Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
Co-lexicographically Ordering Automata and Regular Languages - Part I. J. ACM 70 (4) (2023)
Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. SPIRE (2023)
Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza
Sorting Finite Automata via Partition Refinement. ESA (2023)
Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza
Random Wheeler Automata. CoRR (2023)
Nicola Prezza
Algorithms for Massive Data - Lecture Notes. CoRR (2023)
Stefano Calzavara, Lorenzo Cazzaro, Giulio Ermanno Pibiri, Nicola Prezza
Verifiable Learning for Robust Tree Ensembles. CCS (2023)
Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza
Sorting Finite Automata via Partition Refinement. CoRR (2023)
Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
Toward a Definitive Compressibility Measure for Repetitive Sequences. IEEE Trans. Inf. Theory 69 (4) (2023)
Omar Ahmed, Andrej Baláz, Nathaniel K. Brown, Lore Depuydt, Adrián Goga, Alessia Petescia, Mohsen Zakeri, Jan Fostier, Travis Gagie, Ben Langmead, Gonzalo Navarro, Nicola Prezza
r-indexing without backward searching. CoRR (2023)
Stefano Calzavara, Lorenzo Cazzaro, Giulio Ermanno Pibiri, Nicola Prezza
Verifiable Learning for Robust Tree Ensembles. CoRR (2023)
Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino
Computing matching statistics on Wheeler DFAs. CoRR (2023)
Alberto Policriti, Nicola Prezza
Special Issue on Algorithms and Data-Structures for Compressed Computation. Algorithms 15 (12) (2022)
Jarno Alanko, Nicola Cotumaccio, Nicola Prezza
Linear-time Minimization of Wheeler DFAs. DCC (2022)
Mai Alzamel, Costas S. Iliopoulos, Dimitrios Letsios, Nicola Prezza
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW). Algorithmica 84 (3) (2022)
Dominik Köppl, Gonzalo Navarro, Nicola Prezza
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. DCC (2022)
Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
Co-lexicographically ordering automata and regular languages. Part I. CoRR (2022)
Dominik Köppl, Gonzalo Navarro, Nicola Prezza
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. CoRR (2021)
Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
Which Regular Languages can be Efficiently Indexed? CoRR (2021)
Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
Wheeler languages. Inf. Comput. 281 (2021)
Nicola Prezza
Subpath Queries on Compressed Graphs: A Survey. Algorithms 14 (1) (2021)
Giovanna D'Agostino, Nicola Cotumaccio, Alberto Policriti, Nicola Prezza
On (co-lex) Ordering Automata. CoRR (2021)
Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
Optimal-Time Dictionary-Compressed Indexes. ACM Trans. Algorithms 17 (1) (2021)
Gonzalo Navarro, Carlos Ochoa, Nicola Prezza
On the Approximation Ratio of Ordered Parsings. IEEE Trans. Inf. Theory 67 (2) (2021)
Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. SOFSEM (2021)
Jarno Alanko, Nicola Cotumaccio, Nicola Prezza
Linear-time Minimization of Wheeler DFAs. CoRR (2021)
Gabriele Fici, Nicola Prezza, Rossano Venturini
Adaptive learning of compressible strings. Theor. Comput. Sci. 896 (2021)
Nicola Cotumaccio, Nicola Prezza
On Indexing and Compressing Finite Automata. SODA (2021)
Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini
Compressed Weighted de Bruijn Graphs. CPM (2021)
Nicola Prezza
Optimal Substring Equality Queries with Applications to Sparse Text Indexing. ACM Trans. Algorithms 17 (1) (2021)
Nicola Prezza, Giovanna Rosone
Space-efficient construction of compressed suffix trees. Theor. Comput. Sci. 852 (2021)
Nicola Prezza
On Locating Paths in Compressed Tries. SODA (2021)
Travis Gagie, Gonzalo Navarro, Nicola Prezza
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space. J. ACM 67 (1) (2020)
Nicola Prezza
Subpath Queries on Compressed Graphs: a Survey. CoRR (2020)
Nicola Prezza
On Locating Paths in Compressed Cardinal Trees. CoRR (2020)
Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. CoRR (2020)
Nicola Prezza
Indexing Compressed Text: A Tale of Time and Space (Invited Talk). SEA (2020)
Gabriele Fici, Nicola Prezza, Rossano Venturini
Substring Query Complexity of String Reconstruction. CoRR (2020)
Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
Towards a Definitive Measure of Repetitiveness. LATIN (2020)
Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude, Gonzalo Navarro, Juan J. Lastra-Díaz, Nicola Prezza, Diego Seco
On the Reproducibility of Experiments of Indexing Repetitive Document Collections. CIRCLE (2020)
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Nicola Prezza, Giovanna Rosone
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. Algorithms Mol. Biol. 15 (1) (2020)
Nicola Prezza, Giovanna Rosone
Faster Online Computation of the Succinct Longest Previous Factor Array. CiE (2020)
Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza
Decompressing Lempel-Ziv Compressed Text. DCC (2020)
Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
Regular Languages meet Prefix Sorting. SODA (2020)
Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone
Variable-order reference-free variant discovery with the Burrows-Wheeler Transform. BMC Bioinform. (8) (2020)
Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
Wheeler Languages. CoRR (2020)
Nicola Cotumaccio, Nicola Prezza
On Indexing and Compressing Finite Automata. CoRR (2020)
Jarno Alanko, Alberto Policriti, Nicola Prezza
On Prefix-Sorting Finite Automata. CoRR (2019)
Nicola Prezza, Giovanna Rosone
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform. CoRR (2019)
Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude, Gonzalo Navarro, Juan J. Lastra-Díaz, Nicola Prezza, Diego Seco
On the Reproducibility of Experiments of Indexing Repetitive Document Collections. CoRR (2019)
Nicola Prezza, Giovanna Rosone
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform. CPM (2019)
Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
Towards a Definitive Measure of Repetitiveness. CoRR (2019)
Gonzalo Navarro, Nicola Prezza
Universal compressed text indexing. Theor. Comput. Sci. 762 (2019)
Davide Della Giustina, Nicola Prezza, Rossano Venturini
A New Linear-Time Algorithm for Centroid Decomposition. SPIRE (2019)
Nicola Prezza, Giovanna Rosone
Space-Efficient Construction of Compressed Suffix Trees. CoRR (2019)
Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude, Gonzalo Navarro, Juan J. Lastra-Díaz, Nicola Prezza, Diego Seco
On the reproducibility of experiments of indexing repetitive document collections. Inf. Syst. 83 (2019)
Nicola Prezza
Optimal Rank and Select Queries on Dictionary-Compressed Text. CPM (2019)
Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone
SNPs detection by eBWT positional clustering. Algorithms Mol. Biol. 14 (1) (2019)
Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone
Online Algorithms on Antipowers and Antiperiods. SPIRE (2019)
Nicola Prezza
On String Attractors. ICTCS (2018)
Travis Gagie, Gonzalo Navarro, Nicola Prezza
Optimal-Time Text Indexing in BWT-runs Bounded Space. SODA (2018)
Nicola Prezza
Optimal Rank and Select Queries on Dictionary-Compressed Text. CoRR (2018)
Alberto Policriti, Nicola Prezza
LZ77 Computation Based on the Run-Length Encoded BWT. Algorithmica 80 (7) (2018)
Nicola Prezza
Optimal Substring-Equality Queries with Applications to Sparse Text Indexing. CoRR (2018)
Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg
String Attractors: Verification and Optimization. CoRR (2018)
Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone
Detecting Mutations by eBWT. WABI (2018)
Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza
A separation between RLSLPs and LZ77. J. Discrete Algorithms 50 (2018)
Gonzalo Navarro, Nicola Prezza
Faster Attractor-Based Indexes. CoRR (2018)
Travis Gagie, Gonzalo Navarro, Nicola Prezza
On the Approximation Ratio of Lempel-Ziv Parsing. LATIN (2018)
Dominik Kempa, Nicola Prezza
At the roots of dictionary compression: string attractors. STOC (2018)
Travis Gagie, Gonzalo Navarro, Nicola Prezza
Fully-Functional Suffix Trees and Optimal Text Searching in BWT-runs Bounded Space. CoRR (2018)
Gonzalo Navarro, Nicola Prezza
On the Approximation Ratio of Greedy Parsings. CoRR (2018)
Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone
Detecting Mutations by eBWT. CoRR (2018)
Gonzalo Navarro, Nicola Prezza
Universal Compressed Text Indexing. CoRR (2018)
Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza
Fast Lempel-Ziv Decompression in Linear Space. CoRR (2018)
Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg
String Attractors: Verification and Optimization. ESA (2018)
Nicola Prezza
In-Place Sparse Suffix Sorting. SODA (2018)
Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen
Succinct Partial Sums and Fenwick Trees. CoRR (2017)
Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza
A Separation Between Run-Length SLPs and LZ77. CoRR (2017)
Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen
Succinct Partial Sums and Fenwick Trees. SPIRE (2017)
Nicola Prezza
A Framework of Dynamic Data Structures for String Processing. CoRR (2017)
Alberto Policriti, Nicola Prezza
From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. CoRR (2017)
Nicola Prezza
A Framework of Dynamic Data Structures for String Processing. SEA (2017)
Travis Gagie, Gonzalo Navarro, Nicola Prezza
Fast Locating with the RLBWT. CoRR (2017)
Philip Bille, Inge Li Gørtz, Nicola Prezza
Space-Efficient Re-Pair Compression. DCC (2017)

Nicola Prezza.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nicola Prezza