DISC 2017 Review

Symmetry-breaking problems are among the most well studied in the field of distributed computing and yet the most fundamental questions about their complexity remain open. In this article we work in the LOCAL model (where the input graph and underlying ...

The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale parallel computation frameworks and has recently gained a lot of importance, especially in the context of classic graph problems. In this work, we ...

We present a simple polylogarithmic-time deterministic distributed algorithm for network decomposition. This improves on a celebrated 2 ^O(√logn)-time algorithm of Panconesi and Srinivasan [STOC’92] and settles a central and long-standing question in ...