On probabilistic snap-stabilization

DOI10.1016/j.tcs.2015.08.001zbMath1371.68031OpenAlexW1669446968MaRDI QIDQ2357149

Stéphane Devismes, Karine Altisen

Publication date: 19 June 2017

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

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

zbMATH Keywords

probabilistic algorithmsleader electionsnap-stabilization

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Related Items (max. 100)

A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem ⋮ Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees ⋮ Snap-stabilizing tasks in anonymous networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic self-stabilization
• Defining liveness
• Self-stabilizing extensions for message-passing systems
• Snap-stabilization and PIF in tree networks
• Fault-containing self-stabilizing distributed protocols
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• Optimal reactive k -stabilization
• The Conic toolkit for building distributed systems
• Self-stabilizing systems in spite of distributed control
• Snap-Stabilizing Waves in Anonymous Networks
• When graph theory helps self-stabilization
• Probability

This page was built for publication: On probabilistic snap-stabilization