Linial's Lower Bound Made Easy
Abstract
Linial's seminal result shows that any deterministic distributed algorithm that finds a 3-colouring of an n-cycle requires at least *(n)/2 - 1 communication rounds. We give a new simpler proof of this theorem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.