research
∙
05/30/2023
Algorithmic Foundations of Inexact Computing
Inexact computing also referred to as approximate computing is a style o...
share
research
∙
12/30/2022
Recurrent Problems in the LOCAL model
The paper considers the SUPPORTED model of distributed computing introdu...
research
∙
11/15/2022
Byzantine Spectral Ranking
We study the problem of rank aggregation where the goal is to obtain a g...
research
∙
04/18/2022
Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds
We study the distributed minimum spanning tree (MST) problem, a fundamen...
research
∙
02/28/2022
Guarding Polygons with Holes
We study the Cooperative Guarding problem for polygons with holes in a m...
research
∙
05/12/2020
Guarding a Polygon Without Losing Touch
We study the classical Art Gallery Problem first proposed by Klee in 197...
research
∙
02/13/2020
Distributed Graph Realizations
We study graph realization problems from a distributed perspective and w...
research
∙
09/22/2019
Randomized Gathering of Asynchronous Mobile Robots
This paper revisits the widely researched gathering problem for two robo...
research
∙
09/04/2019
Shortest Paths in a Hybrid Network Model
We introduce a communication model for hybrid networks, where nodes have...
research
∙
07/28/2019
Spartan: Sparse Robust Addressable Networks
We present an overlay design called Sparse Robust Addressable Network (S...
research
∙
07/24/2019
Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols
Motivated, in part, by the rise of permissionless systems such as Bitcoi...
research
∙
02/24/2019
Latency, Capacity, and Distributed MST
Consider the problem of building a minimum-weight spanning tree for a gi...
research
∙
05/18/2018