Davide Cenzato

Orcid: 0000-0002-0098-3620

According to our database1, Davide Cenzato authored at least 19 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Compressing Suffix Trees by Path Decompositions.
CoRR, June, 2025

Testing Suffixient Sets.
CoRR, June, 2025

On the number of equal-letter runs of the bijective Burrows-Wheeler transform.
Theor. Comput. Sci., 2025

The Trie Measure, Revisited.
Proceedings of the 36th Annual Symposium on Combinatorial Pattern Matching, 2025

BWT for String Collections.
Proceedings of the Expanding World of Compressed Data: A Festschrift for Giovanni Manzini's 60th Birthday, 2025

2024
r-indexing the eBWT.
Inf. Comput., 2024

On the Complexity of Computing the Co-lexicographic Width of a Regular Language.
CoRR, 2024

On Computing the Smallest Suffixient Set.
Proceedings of the String Processing and Information Retrieval, 2024

Sketching and Streaming for Dictionary Compression.
Proceedings of the Data Compression Conference, 2024

Random Wheeler Automata.
Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

Computing the LCP Array of a Labeled Graph.
Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023
Optimal Wheeler Language Recognition.
Proceedings of the String Processing and Information Retrieval, 2023

Testing Wheelerness of Regular Languages (short paper) (text not included).
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

Sorting Finite Automata via Partition Refinement.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Computing the optimal BWT of very large string collections.
Proceedings of the Data Compression Conference, 2023

2022
CSTs for Terabyte-Sized Data.
Proceedings of the Data Compression Conference, 2022

On different variants of the Burrows-Wheeler-Transform of string collections.
Proceedings of the Data Compression Conference, 2022

A Theoretical and Experimental Analysis of BWT Variants for String Collections.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
Computing the Original eBWT Faster, Simpler, and with Less Memory.
Proceedings of the String Processing and Information Retrieval, 2021


  Loading...