We present a simple deterministic distributed algorithm that computes a (Δ+1)-vertex
coloring in O(log^2Δ.log\n) rounds. The algorithm can be implemented with O(log\n)-bit …

We develop a general deterministic distributed method for locally rounding fractional
solutions of graph problems for which the analysis can be broken down into analyzing pairs …

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 prove several new tight or near-tight distributed lower bounds for classic symmetry
breaking problems in graphs. As a basic tool, we first provide a new insightful proof that any …

The distributed coloring problem is at the core of the area of distributed graph algorithms
and it is a problem that has seen tremendous progress over the last few years. Much of the …

In this article, we present a deterministic algorithm to compute an O (k Δ)-vertex coloring in O
(Δ/k)+ log* n rounds, where Δ is the maximum degree of the network graph and k≥ 1 can be …

We provide new deterministic algorithms for the edge coloring problem, which is one of the
classic and highly studied distributed local symmetry breaking problems. As our main result …

We give a randomized Δ-coloring algorithm in the LOCAL model that runs in poly log log n
rounds, where n is the number of nodes of the input graph and Δ is its maximum degree …

We present a randomized distributed algorithm that computes a Δ-coloring in any non-
complete graph with maximum degree Δ≥ 4 in O (log Δ)+ 2O (√ log log n) rounds, as well …