There are distributed graph algorithms for finding maximal matchings and maximal
independent sets in O (Δ+ log* n) communication rounds; here, n is the number of nodes …

Linial's famous color reduction algorithm reduces a given $ m $-coloring of a graph with
maximum degree $\Delta $ to a $ O (\Delta^ 2\log m) $-coloring, in a single round in the …

We present a complete classification of the deterministic distributed time complexity for a
family of graph problems: binary labeling problems in trees. These are locally checkable …

We study connections between distributed local algorithms, finitary factors of iid processes,
and descriptive combinatorics in the context of regular trees. We extend the Borel …

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 …

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 …

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 …

In this paper, we study the power and limitations of component-stable algorithms in the low-
space model of Massively Parallel Computation (MPC). Recently Ghaffari, Kuhn and Uitto …

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 …

A rich line of work has been addressing the computational complexity of locally checkable
labelings (LCLs), illustrating the landscape of possible complexities. In this paper, we study …