1 citations · 1 across the 2 of their papers we have counts for
2 papers
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.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…