12 citations · 65 across the 21 of their papers we have counts for
31 papers
Algorithmic Foundations of Inexact Computing
John Augustine, Dror Fried, Krishna V. Palem +2
Inexact computing also referred to as approximate computing is a style of designing algorithms and computing systems wherein the accuracy of correctness of algorithms executing on…
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…
Economy Versus Disease Spread: Reopening Mechanisms for COVID 19
John Augustine, Khalid Hourani, Anisur Rahaman Molla +2
We study mechanisms for reopening economic activities that explore the trade off between containing the spread of COVID-19 and maximizing economic impact. This is of current import…
Guarding a Polygon Without Losing Touch
Barath Ashok, John Augustine, Aditya Mehekare +3
We study the classical Art Gallery Problem first proposed by Klee in 1973 from a mobile multi-agents perspective. Specifically, we require an optimally small number of agents (also…