12 citations · 65 across the 21 of their papers we have counts for
7 papers · 1 filter
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…
Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities
Guru Prakash Arumugam, John Augustine, Mordecai J. Golin +3
A Dynamic Graph Network is a graph in which each edge has an associated travel time and a capacity (width) that limits the number of items that can travel in parallel along that ed…
Balanced Allocation: Patience is not a Virtue
John Augustine, William K. Moses, Amanda Redlich +1
Load balancing is a well-studied problem, with balls-in-bins being the primary framework. The greedy algorithm of Azar et al. places each ball by probing $d >…
A Polynomial Time Algorithm for Minimax-Regret Evacuation on a Dynamic Path
Guru Prakash Arumugam, John Augustine, Mordecai J. Golin +1
A dynamic path network is an undirected path with evacuees situated at each vertex. To evacuate the path, evacuees travel towards a designated sink (doorway) to exit. Each edge has…
Distributed Agreement in Dynamic Peer-to-Peer Networks
John Augustine, Gopal Pandurangan, Peter Robinson +1
Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-Peer (P2P) networks, we study algorithms for the fundamental distributed agreement probl…
On the Continuous CNN Problem
John Augustine, Nick Gravin
In the (discrete) CNN problem, online requests appear as points in . Each request must be served before the next one is revealed. We have a server that can serve a re…