Self-stabilization (in spite of distributed control) in tree-structured systems
From MaRDI portal
Cites work
Cited in
(18)- A self-stabilizing algorithm for constructing spanning trees
- Binary self-stabilization in distributed systems
- A self-stabilizing algorithm for constructing breadth-first trees
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Self-stabilization over unreliable communication media
- Self-stabilizing depth-first token circulation on networks
- The local detection paradigm and its applications to self-stabilization
- Snap-stabilization and PIF in tree networks
- Game theoretic analysis of self-stabilizing systems on arrays
- SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS
- SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM
- Reliable synchronization in distributed systems
- A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
- A self-stabilizing graph algorithm: Finding the cutting center of a tree
- Self-stabilizing token circulation in uniform networks
- Self-stabilizing depth-first token circulation in arbitrary rooted networks
- A self-stabilizing algorithm for finding articulation points
- On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms
This page was built for publication: Self-stabilization (in spite of distributed control) in tree-structured systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252035)