3 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
Towards Optimal Deterministic LOCAL Algorithms on Trees
Sebastian Brandt, Ananth Narayanan
While obtaining optimal algorithms for the most important problems in the LOCAL model has been one of the central goals in the area of distributed algorithms since its infancy, tig…
cs.DS2025
On the Locality of Hall's Theorem
Sebastian Brandt, Yannic Maus, Ananth Narayanan +2
The last five years of research on distributed graph algorithms have seen huge leaps of progress, both regarding algorithmic improvements and impossibility results: new strong lowe…