20 citations · 132 across the 38 of their papers we have counts for
Showing 2018 · cs.DCShow all
3 papers · 2 filters
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.DC2018
Efficient size estimation and impossibility of termination in uniform dense population protocols
David Doty, Mahsa Eftekhari
We study uniform population protocols: networks of anonymous agents whose pairwise interactions are chosen at random, where each agent uses an identical transition algorithm that d…
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…