1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2025★ 1 cited
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.DC2025
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…