Massimo Equi

29 papers A* 3A 1B 4C 2Journal 16Unranked 2
YearRankTypeTitle / Venue / Authors
2026 A* conf
Distributed Quantum Advantage in Locally Checkable Labeling Problems.
SODA
Alkida Balliu, Filippo Casagrande, Francesco d'Amore, Massimo Equi, Barbara Keller, Henrik Lievonen, Dennis Olivetti, Gustav Schmid, Jukka Suomela
2026 J jnl
Is a LOCAL algorithm computable?
CoRR
Antonio Cruciani, Avinandan Das, Massimo Equi, Henrik Lievonen, Diep Luong-Le, Augusto Modanese, Jukka Suomela
2026 J jnl
Quantum Pattern Matching in Generalised Degenerate Strings.
CoRR
Massimo Equi, Md Rabiul Islam Khan, Veli Mäkinen
2025 — conf
Conditional Lower Bounds for String Matching in Labelled Graphs.
From Strings to Graphs, and Back Again
Massimo Equi
2025 A* conf
Distributed Quantum Advantage for Local Problems.
STOC
Alkida Balliu, Sebastian Brandt, Xavier Coiteux-Roy, Francesco d'Amore, Massimo Equi, François Le Gall, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Marc-Olivier Renou, Jukka Suomela, Lucas Tendick, Isadora Veeren
2025 J jnl
Distributed Quantum Advantage in Locally Checkable Labeling Problems.
CoRR
Alkida Balliu, Filippo Casagrande, Francesco d'Amore, Massimo Equi, Barbara Keller, Henrik Lievonen, Dennis Olivetti, Gustav Schmid, Jukka Suomela
2025 — conf
Graph Indexing Beyond Wheeler Graphs.
The Expanding World of Compressed Data
Jarno N. Alanko, Elena Biagi, Massimo Equi, Veli Mäkinen, Simon J. Puglisi, Nicola Rizzo, Kunihiko Sadakane, Jouni Sirén
2025 A conf
New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs.
DISC
Alkida Balliu, Corinna Coupette, Antonio Cruciani, Francesco d'Amore, Massimo Equi, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Jukka Suomela
2025 J jnl
New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs.
CoRR
Alkida Balliu, Corinna Coupette, Antonio Cruciani, Francesco d'Amore, Massimo Equi, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Jukka Suomela
2025 B conf
Orientation Does Not Help with 3-Coloring a Grid in Online-LOCAL.
OPODIS
Thomas Boudier, Filippo Casagrande, Avinandan Das, Massimo Equi, Henrik Lievonen, Augusto Modanese, Ronja Stimpert
2025 J jnl
Orientation does not help with 3-coloring a grid in online-LOCAL.
CoRR
Thomas Boudier, Filippo Casagrande, Avinandan Das, Massimo Equi, Henrik Lievonen, Augusto Modanese, Ronja Stimpert
2024 C conf
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs.
WABI
Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estéban Gabory, Roberto Grossi, Nadia Pisanti
2024 J jnl
Distributed Quantum Advantage for Local Problems.
CoRR
Alkida Balliu, Sebastian Brandt, Xavier Coiteux-Roy, Francesco d'Amore, Massimo Equi, François Le Gall, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Marc-Olivier Renou, Jukka Suomela, Lucas Tendick, Isadora Veeren
2024 J jnl
Elastic founder graphs improved and enhanced.
Theor. Comput. Sci.
Nicola Rizzo, Massimo Equi, Tuukka Norri, Veli Mäkinen
2023 J jnl
Algorithms and Complexity on Indexing Founder Graphs.
Algorithmica
Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
2023 J jnl
Elastic Founder Graphs Improved and Enhanced.
CoRR
Nicola Rizzo, Massimo Equi, Tuukka Norri, Veli Mäkinen
2023 B conf
From Bit-Parallelism to Quantum String Matching for Labelled Graphs.
CPM
Massimo Equi, Arianne Meijer-van de Griend, Veli Mäkinen
2023 J jnl
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails.
Theor. Comput. Sci.
Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu
2023 J jnl
On the Complexity of String Matching for Graphs.
ACM Trans. Algorithms
Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi
2022 — —
Lower and Upper Bounds for String Matching in Labelled Graphs ; Ala- ja ylärajoja merkkijonon etsinnälle verkosta.
Massimo Equi
2021 B conf
Algorithms and Complexity on Indexing Elastic Founder Graphs.
ISAAC
Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
2021 J jnl
Algorithms and Complexity on Indexing Founder Graphs.
CoRR
Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
2021 B conf
Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails.
SOFSEM
Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu
2020 J jnl
Conditional Indexing Lower Bounds Through Self-Reducibility.
CoRR
Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu
2020 C conf
Linear Time Construction of Indexable Founder Block Graphs.
WABI
Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu
2020 J jnl
Linear Time Construction of Indexable Founder Block Graphs.
CoRR
Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu
2019 J jnl
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree.
CoRR
Massimo Equi, Roberto Grossi, Veli Mäkinen
2019 J jnl
On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching.
CoRR
Massimo Equi, Roberto Grossi, Alexandru I. Tomescu, Veli Mäkinen
2019 A* conf
On the Complexity of String Matching for Graphs.
ICALP
Massimo Equi, Roberto Grossi, Veli Mäkinen, Alexandru I. Tomescu