
Guarding a Polygon Without Losing Touch
We study the classical Art Gallery Problem first proposed by Klee in 197...
read it

Distributed Graph Realizations
We study graph realization problems from a distributed perspective and w...
read it

Randomized Gathering of Asynchronous Mobile Robots
This paper revisits the widely researched gathering problem for two robo...
read it

Shortest Paths in a Hybrid Network Model
We introduce a communication model for hybrid networks, where nodes have...
read it

Spartan: Sparse Robust Addressable Networks
We present an overlay design called Sparse Robust Addressable Network (S...
read it

Scalable and Secure Computation Among Strangers: ResourceCompetitive Byzantine Protocols
Motivated, in part, by the rise of permissionless systems such as Bitcoi...
read it

Latency, Capacity, and Distributed MST
Consider the problem of building a minimumweight spanning tree for a gi...
read it

Distributed Computation in the NodeCongested Clique
The Congested Clique model of distributed computing, which was introduce...
read it
John Augustine
is this you? claim profile