| 2026 | CONCUR | Wheeler Bisimulations. | Nicola Cotumaccio |
| 2026 | DLT | Generalized Wheeler Automata: Minimality. | Nicola Cotumaccio |
| 2025 | CPM | Encoding Co-Lex Orders of Finite-State Automata in Linear Space. | Ruben Becker, Nicola Cotumaccio, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni |
| 2025 | CPM | Improved Circular Dictionary Matching. | Nicola Cotumaccio |
| 2025 | DLT | Sorting Circular Suffixes in Linear Time. | Nicola Cotumaccio |
| 2025 | IWOCA | Fast Pattern Matching with Epsilon Transitions. | Nicola Cotumaccio |
| 2024 | CPM | Computing the LCP Array of a Labeled Graph. | Jarno N. Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza |
| 2024 | STACS | A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression. | Nicola Cotumaccio |
| 2023 | DCC | Computing matching statistics on Wheeler DFAs. | Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino |
| 2023 | ISAAC | Prefix Sorting DFAs: A Recursive Algorithm. | Nicola Cotumaccio |
| 2023 | SPIRE | Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. | Nicola Cotumaccio, Travis Gagie, Dominik Kppl, Nicola Prezza |
| 2022 | DCC | Linear-time Minimization of Wheeler DFAs. | Jarno Alanko, Nicola Cotumaccio, Nicola Prezza |
| 2022 | DCC | Graphs can be succinctly indexed for pattern matching in $O(\vert E\vert ^{2}+\vert V\vert ^{5/2})$ time. | Nicola Cotumaccio |
| 2021 | SODA | On Indexing and Compressing Finite Automata. | Nicola Cotumaccio, Nicola Prezza |