Equi, Massimo

1. Distributed Quantum Advantage for Local Problems
   2024/11/05 by Alkida Balliu, Sebastian Brandt, Balliu, Alkida +23 · 1 voice · 5 citations
   #cs.DC #cs.CC #quant-ph
2. Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
   2020/02/03 by Equi, Massimo, Mäkinen, Veli, Tomescu, Alexandru I. · 1 citation
   #Computational Complexity (cs.CC) #E.1 #F.1 #F.2.2 #FOS: Computer and information sciences #G.2.2
3. Algorithms and Complexity on Indexing Founder Graphs
   2021/02/25 by Equi, Massimo, Norri, Tuukka, Alanko, Jarno +3 · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #E.1 #E.4 #F.1.3 #F.2.2 #FOS: Computer and information sciences
4. New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
   2025/06/09 by Alkida Balliu, Corinna Coupette, Balliu, Alkida +15 · 1 voice · 2 citations
   #cs.DC #cs.CC