Massimo Equi

According to our database, Massimo Equi authored at least 16 papers between 2019 and 2025.

Collaborative distances:

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

2025

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs.

Alkida Balliu, Corinna Coupette, Antonio Cruciani, Francesco D'Amore, Massimo Equi, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Jukka Suomela

CoRR, June, 2025

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

CoRR, April, 2025

Distributed Quantum Advantage for Local Problems.

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

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Conditional Lower Bounds for String Matching in Labelled Graphs.

Massimo Equi

Proceedings of the From Strings to Graphs, 2025

Graph Indexing Beyond Wheeler Graphs.

Jarno N. Alanko, Elena Biagi, Massimo Equi, Veli Mäkinen, Simon J. Puglisi, Nicola Rizzo, Kunihiko Sadakane, Jouni Sirén

Proceedings of the Expanding World of Compressed Data: A Festschrift for Giovanni Manzini's 60th Birthday, 2025

2024

Elastic founder graphs improved and enhanced.

Nicola Rizzo, Massimo Equi, Tuukka Norri, Veli Mäkinen

Theor. Comput. Sci., January, 2024

A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs.

Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estéban Gabory, Roberto Grossi, Nadia Pisanti

Proceedings of the 24th International Workshop on Algorithms in Bioinformatics, 2024

2023

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails.

Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu

Theor. Comput. Sci., October, 2023

On the Complexity of String Matching for Graphs.

Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi

ACM Trans. Algorithms, July, 2023

Algorithms and Complexity on Indexing Founder Graphs.

Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen

Algorithmica, June, 2023

From Bit-Parallelism to Quantum String Matching for Labelled Graphs.

Massimo Equi, Arianne Meijer-van de Griend, Veli Mäkinen

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2021

Algorithms and Complexity on Indexing Elastic Founder Graphs.

Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Conditional Indexing Lower Bounds Through Self-Reducibility.

Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu

CoRR, 2020

Linear Time Construction of Indexable Founder Block Graphs.

Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu

Proceedings of the 20th International Workshop on Algorithms in Bioinformatics, 2020

2019

On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching.

Massimo Equi, Roberto Grossi, Alexandru I. Tomescu, Veli Mäkinen

CoRR, 2019

On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree.

Massimo Equi, Roberto Grossi, Veli Mäkinen

CoRR, 2019