We consider leader election in clique networks, where n nodes are connec...
A singularly (near) optimal distributed algorithm is one that is (near)
...
Introduced by Korman, Kutten, and Peleg (PODC 2005), a proof labeling sc...
This paper concerns designing distributed algorithms that are singularly...
It was suggested that a programmable matter system (composed of multiple...
The first generic self-stabilizing transformer for local problems in a
c...
This paper considers a variant of the online paging problem, where the o...
We generalize the definition of Proof Labeling Schemes to reactive syste...
This paper presents a randomized self-stabilizing algorithm that elects ...
This paper concerns designing distributed algorithms that are singularly...
In this paper, a rather general online problem called dynamic resource
a...
A new spanner construction algorithm is presented, working under the
LOC...
We study network coordination problems, as captured by the setting of
ge...
Addressing a fundamental problem in programmable matter, we present the ...
A widely studied problem in communication networks is that of finding th...
A matching of a graph is a subset of edges no two of which share a commo...
The set cover problem is one of the most fundamental problems in compute...
This paper investigates the message complexity of distributed informatio...
In a generalized network design (GND) problem, a set of resources are
as...