1 research outputs found
Linial's Lower Bound Made Easy
Linial's seminal result shows that any deterministic distributed algorithm
that finds a -colouring of an -cycle requires at least
communication rounds. We give a new simpler proof of this theorem.Comment: 3 pages, 1 figur