Self-stabilizing depth-first token circulation in arbitrary rooted networks
From MaRDI portal
Publication:5137905
Recommendations
Cites work
- scientific article; zbMATH DE number 1760041 (Why is no real title available?)
- Self-stabilization (in spite of distributed control) in tree-structured systems
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Self-stabilizing depth-first search
- Self-stabilizing depth-first token circulation on networks
- Self-stabilizing multi-token rings
- Self-stabilizing systems in spite of distributed control
- The stabilizing token ring in three bits
- Token systems that self-stabilize
Cited in
(15)- Self-stabilizing depth-first token circulation on networks
- Game theoretic analysis of self-stabilizing systems on arrays
- Safe and stabilizing distributed multi-path cellular flows
- Maintaining balanced trees for structured distributed streaming systems
- Request-based token passing for self-stabilizing mutual exclusion
- An optimal self-stabilizing strarvation-free alternator
- SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS
- scientific article; zbMATH DE number 2036579 (Why is no real title available?)
- scientific article; zbMATH DE number 2061541 (Why is no real title available?)
- scientific article; zbMATH DE number 1751210 (Why is no real title available?)
- Self-stabilizing token circulation in uniform networks
- Snap-Stabilizing Waves in Anonymous Networks
- Communication efficient self-stabilizing leader election
- Self-stabilizing graph exploration by a single agent
- Optimal snap-stabilizing depth-first token circulation in tree networks
This page was built for publication: Self-stabilizing depth-first token circulation in arbitrary rooted networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137905)