Any graph with maximum degree Δ admits a proper vertex coloring with Δ+ 1 colors that can
be found via a simple sequential greedy algorithm in linear time and space. But can one find …

In this paper, we present new randomized algorithms that improve the complexity of the
classic (Δ+ 1)-coloring problem, and its generalization (Δ+ 1)-list-coloring, in three well …

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 …

This paper addresses the cornerstone family of local problems in distributed computing, and
investigates the curious gap between randomized and deterministic solutions under …

We design fast deterministic algorithms for distance computation in the CONGESTED
CLIQUE model. Our key contributions include: A (2+ ε)-approximation for all-pairs shortest …

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 settle the complexity of the (Δ+ 1)-coloring and (Δ+ 1)-list coloring problems in the
CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both …

We present a deterministic O (log log log n)-round low-space Massively Parallel
Computation (MPC) algorithm for the classical problem of (Δ+ 1)-coloring on n-vertex …

A recent palette sparsification theorem of Assadi, Chen, and Khanna [SODA'19] states that in
every $ n $-vertex graph $ G $ with maximum degree $\Delta $, sampling $ O (\log {n}) …