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 …

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 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 …

Given a graph G=(V,E), an (α,β)-ruling set is a subset S⊆V such that the distance between
any two vertices in S is at least α, and the distance between any vertex in V and the closest …

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 …

Consider any locally checkable labeling problem Π in rooted regular trees: there is a finite
set of labels Σ, and for each label χ x Σ we specify what are permitted label combinations of …

Recent research revealed the existence of gaps in the complexity landscape of locally
checkable labeling (LCL) problems in the LOCAL model of distributed computing. For …

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 …

In a recent breakthrough result, Balliu et al.[FOCS'19] proved a deterministic Ω (min (Δ, log
n/log log n))-round and a randomized Ω (min (Δ, log log n/log log log n))-round lower bound …

We extend the theory of locally checkable labeling problems (LCLs) from the classical
LOCAL model to a number of other models that have been studied recently, including the …