Fast Deterministic Rendezvous in Labeled Lines
Miller, Avery, Pelc, Andrzej · arXiv (Cornell University) · 2014
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.