Early adapting to trends: self-stabilizing information spread using passive communication

DOI10.1007/s00446-024-00462-8MaRDI QIDQ6658819

Amos Korman, Unnamed Author

Publication date: 8 January 2025

Published in: Distributed Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple population protocol for fast robust approximate majority
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip
• Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
• Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
• Computation in networks of passively mobile finite-state sensors
• Polylogarithmic-Time Leader Election in Population Protocols
• Self-stabilizing systems in spite of distributed control
• Rumor Spreading and Conductance
• Time-Space Trade-offs in Population Protocols
• Introduction to Distributed Self-Stabilizing Algorithms
• Tight Bounds for Rumor Spreading with Vertex Expansion
• Asynchronous gossip
• Global computation in a poorly connected world
• Speed Faults in Computation by Chemical Reaction Networks
• On the Complexity of Information Spreading in Dynamic Networks
• A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks

This page was built for publication: Early adapting to trends: self-stabilizing information spread using passive communication