activity
20192026
most citedOn the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching

5 citations · 8 across the 7 of their papers we have counts for

collaborators

10 papers

quant-ph2026

Quantum Pattern Matching in Generalised Degenerate Strings

Massimo Equi, Md Rabiul Islam Khan, Veli Mäkinen

A degenerate string is a sequence of sets of characters. A generalized degenerate (GD) string extends this notion to the sequence of sets of strings, where strings of the same set…

cs.DC2026★ 2 cited

Is a LOCAL algorithm computable?

Antonio Cruciani, Avinandan Das, Massimo Equi +4

Common definitions of the "standard" LOCAL model tend to be sloppy and even self-contradictory on one point: do the nodes update their state using an arbitrary function or a comput…

cs.DS2023★ 1 cited

Elastic Founder Graphs Improved and Enhanced

Nicola Rizzo, Massimo Equi, Tuukka Norri +1

Indexing labeled graphs for pattern matching is a central challenge of pangenomics. Equi et al. (Algorithmica, 2022) developed the Elastic Founder Graph () representi…

quant-ph2023

From Bit-Parallelism to Quantum String Matching for Labelled Graphs

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

Many problems that can be solved in quadratic time have bit-parallel speed-ups with factor , where is the computer word size. A classic example is computing the edit distanc…

quant-ph2021

Quantum Linear Algorithm for Edit Distance Using the Word QRAM Model

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

Many problems that can be solved in quadratic time have bit-parallel speed-ups with factor , where is the computer word size. For example, edit distance of two strings of le…

cs.DS2021

Algorithms and Complexity on Indexing Founder Graphs

Massimo Equi, Tuukka Norri, Jarno Alanko +3

We study the problem of matching a string in a labeled graph. Previous research has shown that unless the Orthogonal Vectors Hypothesis (OVH) is false, one cannot solve this proble…