17 citations · 23 across the 3 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2015
Towards Optimal Synchronous Counting
Christoph Lenzen, Joel Rybicki, Jukka Suomela
Consider a complete communication network of nodes, where the nodes receive a common clock pulse. We study the synchronous -counting problem: given any starting state and up…
cs.DC2015★ 6 cited
Exact bounds for distributed graph colouring
Joel Rybicki, Jukka Suomela
We prove exact bounds on the time complexity of distributed graph colouring. If we are given a directed path that is properly coloured with colours, by prior work it is known t…
cs.DC2010★ 17 cited
Local algorithms in (weakly) coloured graphs
Matti Åstrand, Valentin Polishchuk, Joel Rybicki +2
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum d…