Massimo Equi

Orcid: 0000-0001-8609-0040

According to our database1, Massimo Equi authored at least 17 papers between 2019 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Orientation does not help with 3-coloring a grid in online-LOCAL.
CoRR, September, 2025

Distributed Quantum Advantage in Locally Checkable Labeling Problems.
CoRR, April, 2025

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs.
Proceedings of the 39th International Symposium on Distributed Computing, 2025

Distributed Quantum Advantage for Local Problems.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Conditional Lower Bounds for String Matching in Labelled Graphs.
Proceedings of the From Strings to Graphs, 2025

Graph Indexing Beyond Wheeler Graphs.
Proceedings of the Expanding World of Compressed Data: A Festschrift for Giovanni Manzini's 60th Birthday, 2025

2024
Elastic founder graphs improved and enhanced.
Theor. Comput. Sci., January, 2024

A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs.
Proceedings of the 24th International Workshop on Algorithms in Bioinformatics, 2024

2023
Algorithms and Complexity on Indexing Founder Graphs.
Algorithmica, June, 2023

From Bit-Parallelism to Quantum String Matching for Labelled Graphs.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2021
Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Algorithms and Complexity on Indexing Elastic Founder Graphs.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Conditional Indexing Lower Bounds Through Self-Reducibility.
CoRR, 2020

Linear Time Construction of Indexable Founder Block Graphs.
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.
CoRR, 2019

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

On the Complexity of String Matching for Graphs.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019


  Loading...