20 citations · 132 across the 38 of their papers we have counts for
11 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 time and space optimal stable population protocol solving exact majority
David Doty, Mahsa Eftekhari, Leszek Gąsieniec +3
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…
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…
Message complexity of population protocols
Talley Amir, James Aspnes, David Doty +2
The standard population protocol model assumes that when two agents interact, each observes the entire state of the other agent. We initiate the study of $\textit{message complexit…
Time-optimal self-stabilizing leader election in population protocols
Janna Burman, Ho-Lin Chen, Hsueh-Ping Chen +4
We consider the standard population protocol model, where (a priori) indistinguishable and anonymous agents interact in pairs according to uniformly random scheduling. The self-sta…