2 papers
cs.DC2014
Linial's Lower Bound Made Easy
Juhana Laurinharju, Jukka Suomela
Linial's seminal result shows that any deterministic distributed algorithm that finds a -colouring of an -cycle requires at least communication rounds. We g…
cs.DC2012
Weak Models of Distributed Computing, with Connections to Modal Logic
Lauri Hella, Matti Järvisalo, Antti Kuusisto +5
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and study models of computing that are weaker version…