2 papers
cs.DC2026
Optimal Deterministic Rendezvous in Labeled Lines
Yann Bourreau, Ananth Narayanan, Alexandre Nolin
In a rendezvous task, some mobile agents dispersed in a network have to gather at an arbitrary common site. We consider the rendezvous problem on the infinite labeled line, with $2…
cs.DC2025
Faster Distributed -Coloring via a Reduction to MIS
Yann Bourreau, Sebastian Brandt, Alexandre Nolin
Recent improvements on the deterministic complexities of fundamental graph problems in the LOCAL model of distributed computing have yielded state-of-the-art upper bounds of $\tild…