5 papers · 1 filter
Dynamic size counting in population protocols
David Doty, Mahsa Eftekhari
The population protocol model describes a network of anonymous agents that interact asynchronously in pairs chosen at random. Each agent starts in the same initial state . We in…
A survey of size counting in population protocols
David Doty, Mahsa Eftekhari
The population protocol model describes a network of anonymous agents who cannot control with whom they interact. The agents collectively solve some computational problem throu…
A stable majority population protocol using logarithmic time and states
David Doty, Mahsa Eftekhari, Eric Severson
We study population protocols, a model of distributed computing appropriate for modeling well-mixed chemical reaction networks and other physical systems where agents exchange info…
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…
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…