Juhana Laurinharju
ABSTRACT
Linial's seminal result shows that any deterministic distributed algorithm that finds a 3-colouring of an $n$-cycle requires at least log*(n)/2 - 1 communication rounds. We give a new simpler proof of this theorem.
- Leonid Barenboim and Michael Elkin. Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool, 2013. http://dx.doi.org/10.2200/S00520ED1V01Y201307DCT011 doi:10.2200/S00520ED1V01Y201307DCT011. Google Scholar
Cross Ref
- Nathan Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193--201, 1992. http://dx.doi.org/10.1137/0221015 doi:10.1137/0221015. Google ScholarDigital Library
- David Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia, 2000. Google ScholarDigital Library
- Jukka Suomela. A Course on Deterministic Distributed Algorithms. 2014. Online textbook. http://users.ics.aalto.fi/suomela/dda/.Google Scholar
- Roger Wattenhofer. Lecture notes on principles of distributed computing, 2013. http://dcg.ethz.ch/lectures/podc_allstars/.Google Scholar
Index Terms
- Brief announcement: Linial's lower bound made easy
Recommendations
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingOver the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially ...
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed ComputingWe study local symmetry breaking problems in the Congest model, focusing on ruling set problems, which generalize the fundamental Maximal Independent Set (MIS) problem. Our work is motivated by the following central question: can we break the long-...
Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering
Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper, we present a new algorithm for $(\Delta+1)$-list coloring in the randomized ${LOCAL}$ model running in $O({Det}_{\scriptscriptstyle d}(\...
Comments