27 citations · 47 across the 12 of their papers we have counts for
1 paper · 2 filters
Christoph Lenzen, Joel Rybicki, Jukka Suomela
Consider a complete communication network of n nodes, where the nodes receive a common clock pulse. We study the synchronous c-counting problem: given any starting state and up…