Massimo Equi

On the Complexity of String Matching for Graphs

2023 · ACM Transactions on Algorithms

Exact string matching in labeled graphs is the problem of searching paths of a graph G=(V, E) such that the concatenation of their node labels is equal to a given pattern string P [1. m …

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs

2025 · arXiv (Cornell University)

In this work, we give two results that put new limits on distributed quantum advantage in the context of the LOCAL model of distributed computing: 1) We show that there is no distributed quantum advantage …