research
∙
12/30/2022
Recurrent Problems in the LOCAL model
The paper considers the SUPPORTED model of distributed computing introdu...
share
research
∙
10/07/2022
The Power of Small Coalitions under Two-Tier Majority on Regular Graphs
In this paper, we study the following problem. Consider a setting where ...
research
∙
10/03/2022
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm
A singularly (near) optimal distributed algorithm is one that is (near) ...
research
∙
08/04/2021
Singularly Near Optimal Leader Election in Asynchronous Networks
This paper concerns designing distributed algorithms that are singularly...
research
∙
07/07/2021
Budgeted Dominating Sets in Uncertain Graphs
We study the Budgeted Dominating Set (BDS) problem on uncertain graphs, ...
research
∙
08/06/2020
Singularly Optimal Randomized Leader Election
This paper concerns designing distributed algorithms that are singularly...
research
∙
02/13/2020
Distributed Graph Realizations
We study graph realization problems from a distributed perspective and w...
research
∙
12/31/2019
Efficiently Realizing Interval Sequences
We consider the problem of realizable interval-sequences. An interval se...
research
∙
12/31/2019
Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods
The classical problem of degree sequence realizability asks whether or n...
research
∙
09/25/2019
Hotelling Games with Random Tolerance Intervals
The classical Hotelling game is played on a line segment whose points re...
research
∙
07/15/2019
Hotelling Games with Multiple Line Faults
The Hotelling game consists of n servers each choosing a point on the li...
research
∙
02/20/2018
Wireless Expanders
This paper introduces an extended notion of expansion suitable for radio...
research
∙
01/15/2018