6 citations · 6 across the 2 of their papers we have counts for
2 papers
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…