Brief Announcement: Population Protocols Decide Double-exponential Thresholds

DOI10.1145/3583668.3594571OpenAlexW4380874003MaRDI QIDQ6202218FDOQ6202218

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
• The computational power of population protocols
• 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
• Speed faults in computation by chemical reaction networks
• Title not available (Why is that?)
• Succinct Population Protocols for Presburger Arithmetic

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)