research
∙
01/19/2023
Improved Tradeoffs for Leader Election
We consider leader election in clique networks, where n nodes are connec...
share
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/18/2022
Locally Restricted Proof Labeling Schemes (Full Version)
Introduced by Korman, Kutten, and Peleg (PODC 2005), a proof labeling sc...
research
∙
08/04/2021
Singularly Near Optimal Leader Election in Asynchronous Networks
This paper concerns designing distributed algorithms that are singularly...
research
∙
06/02/2021
Efficient Deterministic Leader Election for Programmable Matter
It was suggested that a programmable matter system (composed of multiple...
research
∙
05/20/2021
Fully Adaptive Self-Stabilizing Transformer for LCL Problems
The first generic self-stabilizing transformer for local problems in a c...
research
∙
11/18/2020
Online Paging with a Vanishing Regret
This paper considers a variant of the online paging problem, where the o...
research
∙
11/04/2020
Reactive Proof Labeling Schemes for Distributed Decision
We generalize the definition of Proof Labeling Schemes to reactive syste...
research
∙
08/10/2020
Communication Efficient Self-Stabilizing Leader Election (Full Version)
This paper presents a randomized self-stabilizing algorithm that elects ...
research
∙
08/06/2020
Singularly Optimal Randomized Leader Election
This paper concerns designing distributed algorithms that are singularly...
research
∙
05/04/2020
No-Regret Stateful Posted Pricing
In this paper, a rather general online problem called dynamic resource a...
research
∙
09/18/2019
Message Reduction in the Local Model is a Free Lunch
A new spanner construction algorithm is presented, working under the LOC...
research
∙
06/30/2019
Bayesian Generalized Network Design
We study network coordination problems, as captured by the setting of ge...
research
∙
05/02/2019
Deterministic Leader Election in Programmable Matter
Addressing a fundamental problem in programmable matter, we present the ...
research
∙
04/23/2019
Maximizing Communication Throughput in Tree Networks
A widely studied problem in communication networks is that of finding th...
research
∙
04/23/2019
Hierarchical b-Matching
A matching of a graph is a subset of edges no two of which share a commo...
research
∙
07/23/2018
Set Cover and Vertex Cover with Delay
The set cover problem is one of the most fundamental problems in compute...
research
∙
06/26/2018
The Communication Cost of Information Spreading in Dynamic Networks
This paper investigates the message complexity of distributed informatio...
research
∙
03/14/2018
