Fast Computation by Population Protocols with a Leader

DOI10.1007/11864219_5zbMath1155.68389OpenAlexW1573401538MaRDI QIDQ3524294

David Eisenstat, James Aspnes, Dana Angluin

Publication date: 9 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11864219_5

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Related Items

Population protocols with faulty interactions: the impact of a leader, Fast computation by population protocols with a leader, Data Collection in Population Protocols with Non-uniformly Random Scheduler, Population protocols with unreliable communication, A simple population protocol for fast robust approximate majority, Synthesizing and Tuning Chemical Reaction Networks with Specified Behaviours, Approximate majority analyses using tri-molecular chemical reaction networks, Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks, Loosely-stabilizing leader election in a population protocol model, Protocols with constant local storage and unreliable communication, The computational power of population protocols, Verification of population protocols, Parallel Computation Using Active Self-assembly, Leaderless Deterministic Chemical Reaction Networks, Unnamed Item, Data collection in population protocols with non-uniformly random scheduler, Loosely-Stabilizing Leader Election in Population Protocol Model