This paper presents near-optimal deterministic parallel and distributed algorithms for
computing (1+ eps)-approximate single-source shortest paths in any undirected weighted …

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 present an Õ (log2 n) round deterministic distributed algorithm for the maximal
independent set problem. By known reductions, this round complexity extends also to …

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 …

This paper presents significantly improved deterministic algorithms for some of the key
problems in the area of distributed graph algorithms, including network decomposition …

We present an intimate connection among the following fields:(a) distributed local
algorithms: coming from the area of computer science,(b) finitary factors of iid processes …

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 …

This paper presents new deterministic and distributed low-diameter decomposition
algorithms for weighted graphs. In particular, we show that if one can efficiently compute …

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 …