default search action
Nicola Cotumaccio
Person information
- affiliation: University of Helsinki, Finland
- affiliation (former): Gran Sasso Science Institute, Italy
- affiliation (former): Dalhousie University, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j2]Nicola Cotumaccio:
Data Compression Meets Automata Theory. Bull. EATCS 145 (2025) - [i14]Ruben Becker, Nicola Cotumaccio, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni:
Encoding Co-Lex Orders of Finite-State Automata in Linear Space. CoRR abs/2503.07061 (2025) - [i13]Nicola Cotumaccio:
Improved Circular Dictionary Matching. CoRR abs/2504.03394 (2025) - 2024
- [c9]Nicola Cotumaccio, Catia Trubiani:
Convex Petri Nets. PNSE@Petri Nets 2024 - [c8]Jarno N. Alanko
, Davide Cenzato, Nicola Cotumaccio
Computing the LCP Array of a Labeled Graph. CPM 2024: 1:1-1:15 - [c7]Nicola Cotumaccio
A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression. STACS 2024: 26:1-26:19 - [i12]Nicola Cotumaccio
Enhanced Graph Pattern Matching. CoRR abs/2402.16205 (2024) - [i11]Jarno Alanko, Davide Cenzato, Nicola Cotumaccio
Computing the LCP Array of a Labeled Graph. CoRR abs/2404.14235 (2024) - 2023
- [j1]Nicola Cotumaccio
Co-lexicographically Ordering Automata and Regular Languages - Part I. J. ACM 70(4): 27:1-27:73 (2023) - [c6]Alessio Conte, Nicola Cotumaccio
Computing matching statistics on Wheeler DFAs. DCC 2023: 150-159 - [c5]Nicola Cotumaccio
Prefix Sorting DFAs: A Recursive Algorithm. ISAAC 2023: 22:1-22:15 - [c4]Nicola Cotumaccio
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. SPIRE 2023: 143-156 - [i10]Alessio Conte, Nicola Cotumaccio
Computing matching statistics on Wheeler DFAs. CoRR abs/2301.05338 (2023) - [i9]Nicola Cotumaccio
A Myhill-Nerode Theorem for Generalized Automata. CoRR abs/2302.06506 (2023) - [i8]Nicola Cotumaccio
Prefix Sorting DFAs: a Recursive Algorithm. CoRR abs/2305.02526 (2023) - [i7]Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza:
Space-time Trade-offs for the LCP Array of Wheeler DFAs. CoRR abs/2306.05684 (2023) - 2022
- [c3]Jarno Alanko
Linear-time Minimization of Wheeler DFAs. DCC 2022: 53-62 - [c2]Nicola Cotumaccio
Graphs can be succinctly indexed for pattern matching in $O(\vert E\vert ^{2}+\vert V\vert ^{5/2})$ time. DCC 2022: 272-281 - [i6]Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Co-lexicographically ordering automata and regular languages. Part I. CoRR abs/2208.04931 (2022) - 2021
- [c1]Nicola Cotumaccio, Nicola Prezza:
On Indexing and Compressing Finite Automata. SODA 2021: 2585-2599 - [i5]Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Which Regular Languages can be Efficiently Indexed? CoRR abs/2102.06798 (2021) - [i4]Giovanna D'Agostino, Nicola Cotumaccio, Alberto Policriti, Nicola Prezza:
On (co-lex) Ordering Automata. CoRR abs/2106.02309 (2021) - [i3]Jarno Alanko, Nicola Cotumaccio, Nicola Prezza:
Linear-time Minimization of Wheeler DFAs. CoRR abs/2111.02480 (2021) - [i2]Nicola Cotumaccio:
Graphs can be succinctly indexed for pattern matching in $ O(|E|^2 + |V|^{5 / 2}) $ time. CoRR abs/2111.04595 (2021) - 2020
- [i1]Nicola Cotumaccio, Nicola Prezza:
On Indexing and Compressing Finite Automata. CoRR abs/2007.07718 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-22 00:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: