92 citations · 480 across the 54 of their papers we have counts for
80 papers
Quantum Advantage for Distributed Symmetry Breaking
Maxime Flin, Longcheng Li, Jukka Suomela
We present a distributed quantum algorithm that -colors cycles in rounds, with high probability. It follows that all locally checkable labeling problems (LCLs) that have…
Distributed Quantum Algorithms Cannot Color Cycles with Probability 1
Xavier Coiteux-Roy, Maxime Flin, Carlos de Gois +3
We prove that any distributed quantum algorithm that finds a -coloring with probability in a cycle of anonymous identical computers has to be global, that is, it needs $Ω(n)…
Rectangular Matrix Multiplication in the Low-Bandwidth Model
Chetan Gupta, Jukka Suomela, Hossein Vahidi
We study rectangular matrix multiplication in the low-bandwidth model of distributed computing. There are computers; initially the input matrices are distributed evenly between…
Meta-Theorems for Cuttable Distributed Problems
Marthe Bonamy, Avinandan Das, Cyril Gavoille +3
We prove that given any -approximation LOCAL algorithm for Minimum Dominating Set (MDS) on planar graphs, we can construct an -round -approximation LOCAL algorithm…
2-Coloring Cycles in One Round
Maxime Flin, Alesya Raevskaya, Ronja Stimpert +2
We show that there is a one-round randomized distributed algorithm that can 2-color cycles such that the expected fraction of monochromatic edges is less than 0.24118. We also show…
Classification of Local Optimization Problems in Directed Cycles
Thomas Boudier, Fabian Kuhn, Augusto Modanese +2
We present a complete classification of the distributed computational complexity of local optimization problems in directed cycles for both the deterministic and the randomized LOC…