Fast Computation by Population Protocols with a Leader

DOI10.1007/11864219_5zbMath1155.68389MaRDI 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

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68W15: Distributed algorithms

Related Items

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