We present an Õ (log2 n) round deterministic distributed algorithm for the maximal
independent set problem. By known reductions, this round complexity extends also to …

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 …

In the LOCAL model of distributed computing, low-diameter decomposition is an extremely
useful tool in designing algorithms, as it allows us to shift from the general graph setting to …

This paper improves and in two cases nearly settles, up to logarithmically lower order
factors, the deterministic complexity of some of the most central problems in distributed …

We present a novel technique for work-efficient parallel derandomization, for algorithms that
rely on the concentration of measure bounds such as Chernoff, Hoeffding, and Bernstein …

In this paper, we present a low-diameter decomposition algorithm in the LOCAL model of
distributed computing that succeeds with probability 1− 1/poly (n). Specifically, we show how …

Graph coloring is fundamental to distributed computing. We give an ultrafast distributed
algorithm for coloring cluster graphs. These graphs are obtained from the underlying …

We provide a $ O (\log^ 6\log n) $-round randomized algorithm for distance-2 coloring in
CONGEST with $\Delta^ 2+ 1$ colors. For $\Delta\gg\operatorname {poly}\log n $, this …

This paper presents parallel, distributed, and quantum algorithms for single-source shortest
paths when edges can have negative integer weights (negative-weight SSSP). We show a …