6 citations · 13 across the 10 of their papers we have counts for
5 papers · 1 filter
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…
Distributed Graph Realizations
John Augustine, Keerti Choudhary, Avi Cohen +3
We study graph realization problems from a distributed perspective and we study it in the node capacitated clique (NCC) model of distributed computing, recently introduced for repr…
Latency, Capacity, and Distributed MST
John Augustine, Seth Gilbert, Fabian Kuhn +2
We study the cost of distributed MST construction in the setting where each edge has a latency and a capacity, along with the weight. Edge latencies capture the delay on the links…
Leader Election in Well-Connected Graphs
Seth Gilbert, Peter Robinson, Suman Sourav
In this paper, we look at the problem of randomized leader election in synchronous distributed networks with a special focus on the message complexity. We provide an algorithm that…
Slow links, fast links, and the cost of gossip
Suman Sourav, Peter Robinson, Seth Gilbert
Consider the classical problem of information dissemination: one (or more) nodes in a network have some information that they want to distribute to the remainder of the network. In…