On probabilistic snap-stabilization
From MaRDI portal
Recommendations
Cites work
- Defining liveness
- Fault-containing self-stabilizing distributed protocols
- scientific article; zbMATH DE number 1332668 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 2006656 (Why is no real title available?)
- scientific article; zbMATH DE number 2036573 (Why is no real title available?)
- Optimal reactive k -stabilization
- Probabilistic self-stabilization
- Probability. Theory and examples.
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
- Self-stabilizing extensions for message-passing systems
- Self-stabilizing systems in spite of distributed control
- Snap-stabilization and PIF in tree networks
- Snap-Stabilizing Waves in Anonymous Networks
- The Conic toolkit for building distributed systems
- When graph theory helps self-stabilization
Cited in
(8)- A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
- Stable snap rounding
- The expressive power of snap-stabilization
- scientific article; zbMATH DE number 2061549 (Why is no real title available?)
- Constant space self-stabilizing center finding algorithms in chains and trees
- Snap-stabilizing tasks in anonymous networks
- Snap-stabilizing tasks in anonymous networks
- Self-stabilizing synchronous unison in directed networks
This page was built for publication: On probabilistic snap-stabilization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357149)