Nicola Cotumaccio

According to our database, Nicola Cotumaccio authored at least 15 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Enhanced Graph Pattern Matching.

Nicola Cotumaccio

CoRR, 2024

A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression.

Nicola Cotumaccio

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Computing the LCP Array of a Labeled Graph.

Jarno N. Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

Convex Petri Nets.

Nicola Cotumaccio, Catia Trubiani

Proceedings of the International Workshop on Petri Nets and Software Engineering 2024 co-located with the 45th International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2024), June 24, 2024

2023

Co-lexicographically Ordering Automata and Regular Languages - Part I.

Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza

J. ACM, August, 2023

A Myhill-Nerode Theorem for Generalized Automata.

Nicola Cotumaccio

CoRR, 2023

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

Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza

Proceedings of the String Processing and Information Retrieval, 2023

Prefix Sorting DFAs: A Recursive Algorithm.

Nicola Cotumaccio

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Computing matching statistics on Wheeler DFAs.

Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino

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.

Nicola Cotumaccio

Proceedings of the Data Compression Conference, 2022

Linear-time Minimization of Wheeler DFAs.

Jarno Alanko, Nicola Cotumaccio, Nicola Prezza

Proceedings of the Data Compression Conference, 2022

2021

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

Nicola Cotumaccio

CoRR, 2021

On (co-lex) Ordering Automata.

Giovanna D'Agostino, Nicola Cotumaccio, Alberto Policriti, Nicola Prezza

CoRR, 2021

Which Regular Languages can be Efficiently Indexed?

Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza

CoRR, 2021

On Indexing and Compressing Finite Automata.

Nicola Cotumaccio, Nicola Prezza

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