Massimo Equi
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
10
Venues
9
Active years
2019–2026
Best venue rank
A*
Where they publish
Papers
10 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | PODC | Brief Announcement: Is a LOCAL Algorithm Computable? | Antonio Cruciani, Avinandan Das, Massimo Equi, Henrik Lievonen, Diep Luong-Le, Augusto Modanese, Jukka Suomela |
| 2026 | SODA | Distributed Quantum Advantage in Locally Checkable Labeling Problems. | Alkida Balliu, Filippo Casagrande, Francesco d'Amore, Massimo Equi, Barbara Keller, Henrik Lievonen, Dennis Olivetti, Gustav Schmid, Jukka Suomela |
| 2025 | OPODIS | Orientation Does Not Help with 3-Coloring a Grid in Online-LOCAL. | Thomas Boudier, Filippo Casagrande, Avinandan Das, Massimo Equi, Henrik Lievonen, Augusto Modanese, Ronja Stimpert |
| 2025 | STOC | Distributed Quantum Advantage for Local Problems. | Alkida Balliu, Sebastian Brandt, Xavier Coiteux-Roy, Francesco d'Amore, Massimo Equi, Franois Le Gall, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Marc-Olivier Renou, Jukka Suomela, Lucas Tendick, Isadora Veeren |
| 2024 | WABI | A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs. | Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estban Gabory, Roberto Grossi, Nadia Pisanti |
| 2023 | CPM | From Bit-Parallelism to Quantum String Matching for Labelled Graphs. | Massimo Equi, Arianne Meijer-van de Griend, Veli Mkinen |
| 2021 | ISAAC | Algorithms and Complexity on Indexing Elastic Founder Graphs. | Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mkinen |
| 2021 | SOFSEM | Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails. | Massimo Equi, Veli Mkinen, Alexandru I. Tomescu |
| 2020 | WABI | Linear Time Construction of Indexable Founder Block Graphs. | Veli Mkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu |
| 2019 | ICALP | On the Complexity of String Matching for Graphs. | Massimo Equi, Roberto Grossi, Veli Mkinen, Alexandru I. Tomescu |