We present a new approach to randomized distributed graph coloring that is simpler and
more efficient than previous ones. In particular, it allows us to tackle the (deg+ 1)-list-coloring …

Distributed vertex coloring is one of the classic problems and probably also the most widely
studied problems in the area of distributed graph algorithms. We present a new randomized …

We present a new technique to efficiently sample and communicate a large number of
elements from a distributed sampling space. When used in the context of a recent Local …

In this paper we present efficient distributed algorithms for classical symmetry breaking
problems, maximal independent sets (MIS) and ruling sets, in power graphs. We work in the …

An adjacency sketching or implicit labeling scheme for a family F of graphs is a method that
defines for any n vertex G∈ F an assignment of labels to each vertex in G, so that the labels …

We present a poly $\log\log n $ time randomized CONGEST algorithm for a natural class of
Lovasz Local Lemma (LLL) instances on constant degree graphs. This implies, among other …

We present a procedure for efficiently sampling colors in the CONGEST model. It allows
nodes whose number of colors exceeds their number of neighbors by a constant fraction to …

We provide a $ O (\log^ 6\log n) $-round randomized algorithm for distance-2 coloring in
CONGEST with $\Delta^ 2+ 1$ colors. For $\Delta\gg\operatorname {poly}\log n $, this …

Graph coloring is fundamental to distributed computing. We give the first general treatment
of the coloring of virtual graphs, where the graph $ H $ to be colored is locally embedded …

Graph coloring is fundamental to distributed computing. We give an ultrafast distributed
algorithm for coloring cluster graphs. These graphs are obtained from the underlying …