Mohsen Ghaffari
ABSTRACT
This keynote talk will provide an overview of a recent line of work [Rozhoň and Ghaffari at STOC 2020; Ghaffari, Harris, and Kuhn at FOCS 2018; and Ghaffari, Kuhn, and Maus at STOC 2017], which presented the first efficient deterministic network decomposition algorithm as well as a general derandomization result for distributed graph algorithms. Informally, the derandomization result shows that any (locally-checkable) graph problem that admits an efficient randomized distributed algorithm also admits an efficient deterministic distributed algorithm. These results resolve several central and decades-old open problems in distributed graph algorithms.
Recommendations
Strong-Diameter Network Decomposition
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed ComputingNetwork decomposition is a central concept in the study of distributed graph algorithms. We present the first polylogarithmic-round deterministic distributed algorithm with small messages that constructs a strong-diameter network decomposition with ...
Polylogarithmic-time deterministic network decomposition and distributed derandomization
STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of ComputingWe 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 ...
Network Decomposition and Distributed Derandomization (Invited Paper)
Structural Information and Communication Complexity
Comments