Massimo Equi

Orcid: 0000-0001-8609-0040

According to our database1, Massimo Equi authored at least 11 papers between 2019 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails.
Theor. Comput. Sci., October, 2023

On the Complexity of String Matching for Graphs.
ACM Trans. Algorithms, July, 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
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


  Loading...