Clocked population protocols

DOI10.1145/3087801.3087836MaRDI QIDQ5368998zbMATH OpenOpenAlexFDO

Authors James Aspnes

Publication date 11 October 2017

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

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

zbMATH Keywords

clockpopulation protocolstransfinite computationnondeterministic logarithmic space

Mathematics Subject Classification ID

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

Recommendations

• Clocked population protocols
• Brief Announcement
• Time and space optimal counting in population protocols
• The computational power of population protocols
• Time-space trade-offs in population protocols

Cited in

(7)

• Large flocks of small birds: on the minimal size of population protocols
• Expressive Power of Broadcast Consensus Protocols
• Running time analysis of broadcast consensus protocols
• Clocked population protocols
• The complexity of verifying population protocols
• How many cooks spoil the soup?
• A totally distributed fair scheduler for population protocols by randomized handshakes

This page was built for publication: Clocked population protocols

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