On the Use of Randomness in Local Distributed Graph Algorithms

DOI10.1145/3293611.3331610OpenAlexW2962809442MaRDI QIDQ5145222

Fabian Kuhn, Mohsen Ghaffari

Publication date: 20 January 2021

Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.00482

zbMATH Keywords

randomnesslocal modeldistributed symmetry breakingcongest modelshared randomness

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Network Decomposition and Distributed Derandomization (Invited Paper) ⋮ Component stability in low-space massively parallel computation

This page was built for publication: On the Use of Randomness in Local Distributed Graph Algorithms