Symmetry-breaking problems are among the most well studied in the field of distributed
computing and yet the most fundamental questions about their complexity remain open. In …

Over the past 30 years numerous algorithms have been designed for symmetry breaking
problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge …

The gap between the known randomized and deterministic local distributed algorithms
underlies arguably the most fundamental and central open question in distributed graph …

We study the distributed (Δ+ 1)-vertex-coloring and (2Δ− 1)-edge-coloring problems. These
problems are among the most important and intensively studied problems in distributed …

Vertex coloring is one of the classic symmetry breaking problems studied in distributed
computing. In this paper we present a new algorithm for (Δ+ 1)-list coloring in the …

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 …

We consider graph coloring and related problems in the distributed message-passing
model.\em Locally-iterative algorithms are especially important in this setting. These are …

We present a deterministic distributed algorithm that computes a (2Δ-1)-edge-coloring, or
even list-edge-coloring, in any n-node graph with maximum degree Δ, in O (log 8 Δ· log n) …

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 …