A Simple Population Protocol for Fast Robust Approximate Majority

DOI10.1007/978-3-540-75142-7_5zbMath1145.68341OpenAlexW1557189197MaRDI QIDQ3523196

David Eisenstat, Dana Angluin, James Aspnes

Publication date: 2 September 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-75142-7_5

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items

Fast computation by population protocols with a leader ⋮ Population protocols with unreliable communication ⋮ Protocols with constant local storage and unreliable communication ⋮ How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model ⋮ Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents