Linial's Lower Bound Made Easy
classification
💻 cs.DC
keywords
linialalgorithmboundcolouringcommunicationcycledeterministicdistributed
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.