12 citations · 65 across the 21 of their papers we have counts for
3 papers · 1 filter
Recurrent Problems in the LOCAL model
Akanksha Agrawal, John Augustine, David Peleg +1
The paper considers the SUPPORTED model of distributed computing introduced by Schmid and Suomela [HotSDN'13], generalizing the LOCAL and CONGEST models. In this framework, multipl…
Awake Complexity of Distributed Minimum Spanning Tree
John Augustine, William K. Moses, Gopal Pandurangan
We study the distributed minimum spanning tree (MST) problem, a fundamental problem in distributed computing. It is well-known that distributed MST can be solved in $\tilde{O}(D+\s…
Guarding Polygons with Holes
John Augustine, Srikkanth Ramachandran
We study the Cooperative Guarding problem for polygons with holes in a mobile multi-agents setting. Given a set of agents, initially deployed at a point in a polygon with verti…