Nicola Cotumaccio

Orcid: 0000-0002-1402-5298

Affiliations:
  • Gran Sasso Science Institute, Italy
  • Dalhousie University, Canada


According to our database1, Nicola Cotumaccio authored at least 13 papers between 2021 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Enhanced Graph Pattern Matching.
CoRR, 2024

A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023
Co-lexicographically Ordering Automata and Regular Languages - Part I.
J. ACM, August, 2023

A Myhill-Nerode Theorem for Generalized Automata.
CoRR, 2023

Space-Time Trade-Offs for the LCP Array of Wheeler DFAs.
Proceedings of the String Processing and Information Retrieval, 2023

Prefix Sorting DFAs: A Recursive Algorithm.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Computing matching statistics on Wheeler DFAs.
Proceedings of the Data Compression Conference, 2023

2022
Graphs can be succinctly indexed for pattern matching in $O(\vert E\vert ^{2}+\vert V\vert ^{5/2})$ time.
Proceedings of the Data Compression Conference, 2022

Linear-time Minimization of Wheeler DFAs.
Proceedings of the Data Compression Conference, 2022

2021
Graphs can be succinctly indexed for pattern matching in $ O(|E|^2 + |V|^{5 / 2}) $ time.
CoRR, 2021

On (co-lex) Ordering Automata.
CoRR, 2021

Which Regular Languages can be Efficiently Indexed?
CoRR, 2021

On Indexing and Compressing Finite Automata.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021


  Loading...