258 citations · 367 across the 20 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2018★ 6 cited
Hardness of computing and approximating predicates and functions with leaderless population protocols
Amanda Belleville, David Doty, David Soloveichik
Population protocols are a distributed computing model appropriate for describing massive numbers of agents with limited computational power. A population protocol "has an initial…
cs.DC2015★ 8 cited
Stable Leader Election in Population Protocols Requires Linear Time
David Doty, David Soloveichik
A population protocol *stably elects a leader* if, for all , starting from an initial configuration with agents each in an identical state, with probability 1 it reaches a c…