Fast Computation by Population Protocols with a Leader

DOI10.1007/11864219_5MaRDI QIDQ3524294zbMATH OpenOpenAlexFDO

Authors Dana Angluin, James Aspnes, David Eisenstat

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)

Recommendations

• Fast computation by population protocols with a leader
• Brief Announcement
• scientific article; zbMATH DE number 7204593
• Polylogarithmic-time leader election in population protocols
• Simple and fast approximate counting and leader election in populations

Cited in

(25)

• Global versus local computations: fast computing with identifiers
• The computational power of population protocols
• Global versus local computations: fast computing with identifiers (short paper)
• Clocked 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
• A simple population protocol for fast robust approximate majority
• Loosely-stabilizing leader election in a population protocol model
• Data Collection in Population Protocols with Non-uniformly Random Scheduler
• Output-oblivious stochastic chemical reaction networks
• scientific article; zbMATH DE number 7204593 (Why is no real title available?)
• Parallel Computation Using Active Self-assembly
• Leaderless Deterministic Chemical Reaction Networks
• Brief Announcement
• Verification of population protocols
• Approximate majority analyses using tri-molecular chemical reaction networks
• Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
• Distributed computation with continual population growth
• Efficient assignment of identities in anonymous populations
• Efficient computation in congested anonymous dynamic networks
• The expressive power of population protocols with logarithmic space

This page was built for publication: Fast Computation by Population Protocols with a Leader

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524294)