SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS
From MaRDI portal
Recommendations
Cites work
- A belated proof of self-stabilization
- A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
- Resource Bounds for Self-Stabilizing Message-Driven Protocols
- 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 extensions for message-passing systems
- Self-stabilizing systems in spite of distributed control
- Stabilizing unison
Cited in
(13)- Self-stabilizing depth-first token circulation on networks
- Constant-space self-stabilizing token distribution in trees
- Request-based token passing for self-stabilizing mutual exclusion
- SELF-STABILIZING DISTRIBUTED SORTING 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?)
- scientific article; zbMATH DE number 7561459 (Why is no real title available?)
- Self-stabilizing multi-token rings
- Self-stabilizing token circulation in uniform networks
- Self-stabilizing depth-first token circulation in arbitrary rooted networks
- Separation of circulating tokens
- Optimal snap-stabilizing depth-first token circulation in tree networks
This page was built for publication: SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2735232)