Brief Announcement: Population Protocols Decide Double-exponential Thresholds

DOI10.1145/3583668.3594571MaRDI QIDQ6202218zbMATH OpenOpenAlexFDO

Authors Philipp Czerner

Publication date 26 March 2024

Published in Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3583668.3594571

zbMATH Keywords

distributed computingpopulation protocolsspace complexity

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cites work

• Computation in networks of passively mobile finite-state sensors
• Computation in networks of passively mobile finite-state sensors
• Convergence speed of binary interval consensus
• How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
• Large flocks of small birds: on the minimal size of population protocols
• Speed faults in computation by chemical reaction networks
• Succinct Population Protocols for Presburger Arithmetic
• The computational power of population protocols

This page was built for publication: Brief Announcement: Population Protocols Decide Double-exponential Thresholds

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