Introduction to the Theory and Applications of Distributed Local Algorithms

For local problems on graphs, distributed and sequential local algorithms are computationally equivalent up to polylogarithmic factors, and randomness in these algorithms can be eliminated with a polylogarithmic slowdown.