Mael Luce

collaborators

3 papers

cs.DC2025

Even-Cycle Detection in the Randomized and Quantum CONGEST Model

Pierre Fraigniaud, Mael Luce, Frederic Magniez +1

We show that, for every $k \geq 2$ , $C_{2 k}$ -freeness can be decided in $O (n^{1 - 1/ k})$ rounds in the \CONGEST{} model by a randomized Monte-Carlo distributed algorithm with one-side…

quant-ph2025

Exponential Quantum Advantage for Message Complexity in Distributed Algorithms

FranÃ§ois Le Gall, MaÃ«l Luce, Joseph Marchand +1

We investigate how much quantum distributed algorithms can outperform classical distributed algorithms with respect to the message complexity (the overall amount of communication u…

cs.DC2025

Deterministic Even-Cycle Detection in Broadcast CONGEST

We show that, for every $k \geq 2$ , $C_{2 k}$ -freeness can be decided in $O (n^{1 - 1/ k})$ rounds in the Broadcast CONGEST model, by a deterministic algorithm. This (deterministic) roun…