Juhana Laurinharju · Jukka Suomela

Brief announcement: Linial’s lower bound made easy

PODC 2014 · 33rd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Paris, France, July 2014 · doi:10.1145/2611462.2611505

authors’ version publisher’s version arXiv.org


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.


Magnús Halldórsson and Shlomi Dolev (Eds.): PODC’14, Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, July 15–18, 2014, Paris, France, pages 377–378, ACM Press, New York, 2014

ISBN 978-1-4503-2944-6


This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.