Follow
Massimo Equi
Massimo Equi
University of Helsinky
Verified email at helsinki.fi - Homepage
Title
Cited by
Cited by
Year
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
M Equi, V Mäkinen, AI Tomescu
SOFSEM 2021: Theory and Practice of Computer Science: 47th International …, 2021
43*2021
Linear time construction of indexable founder block graphs
V Mäkinen, B Cazaux, M Equi, T Norri, AI Tomescu
arXiv preprint arXiv:2005.09342, 2020
242020
On the complexity of string matching for graphs
M Equi, V Mäkinen, AI Tomescu, R Grossi
ACM Transactions on Algorithms, 2023
23*2023
Algorithms and Complexity on Indexing Elastic Founder Graphs
M Equi, T Norri, J Alanko, B Cazaux, AI Tomescu, V Mäkinen
32nd International Symposium on Algorithms and Computation (ISAAC 2021), 2021
9*2021
Pattern matching in labeled graphs
M Equi
22018
From Bit-Parallelism to Quantum String Matching for Labelled Graphs
M Equi, A Meijer-van de Griend, V Mäkinen
34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023) 259, 9:1 …, 2023
12023
Elastic Founder Graphs Improved and Enhanced
N Rizzo, M Equi, T Norri, V Mäkinen
arXiv preprint arXiv:2303.05336, 2023
12023
Lower and Upper Bounds for String Matching in Labelled Graphs
M Equi
Helsingin yliopisto, 2022
12022
The system can't perform the operation now. Try again later.
Articles 1–8