10 citations · 29 across the 25 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DC2018
Fast Approximate Counting and Leader Election in Populations
Othon Michail, Paul G. Spirakis, Michail Theofilatos
We study the problems of leader election and population size counting for population protocols: networks of finite-state anonymous agents that interact randomly under a uniform ran…
cs.DC2018★ 5 cited
Exact size counting in uniform population protocols in nearly logarithmic time
David Doty, Mahsa Eftekhari, Othon Michail +2
We study population protocols: networks of anonymous agents that interact under a scheduler that picks pairs of agents uniformly at random. The _size counting problem_ is that of c…