Protocols with constant local storage and unreliable communication

DOI10.1016/j.tcs.2022.11.006OpenAlexW4308581876MaRDI QIDQ2699979

Mikhail Raskin

Publication date: 20 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.006

zbMATH Keywords

expressive powerpopulation protocolsmessage loss

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Mediated population protocols
• Appraising fairness in languages for distributed programming
• The covering and boundedness problems for vector addition systems
• Population protocols with faulty interactions: the impact of a leader
• The computational power of population protocols
• Time-space trade-offs in population protocols for the majority problem
• The complexity of verifying population protocols
• Population protocols with unreliable communication
• Computation in networks of passively mobile finite-state sensors
• Fast and Exact Majority in Population Protocols
• A Simple Population Protocol for Fast Robust Approximate Majority
• Fast Computation by Population Protocols with a Leader
• Self-stabilizing systems in spite of distributed control
• Verification of Immediate Observation Population Protocols
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• Computation in networks of passively mobile finite-state sensors
• Expressive Power of Broadcast Consensus Protocols
• Stable leader election in population protocols requires linear time

This page was built for publication: Protocols with constant local storage and unreliable communication