A self-stabilizing algorithm for strong fairness
From MaRDI portal
Publication:1387705
Recommendations
Cites work
- scientific article; zbMATH DE number 3972158 (Why is no real title available?)
- A self-stabilizing algorithm for constructing spanning trees
- A self-stabilizing algorithm for strong fairness
- An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives
- Appraising fairness in languages for distributed programming
- Self-stabilizing depth-first search
- Self-stabilizing depth-first token circulation on networks
- Self-stabilizing systems in spite of distributed control
- The mutual exclusion problem
Cited in
(6)- A self-stabilizing algorithm for strong fairness
- scientific article; zbMATH DE number 1330452 (Why is no real title available?)
- scientific article; zbMATH DE number 2036567 (Why is no real title available?)
- A Distributed Maximal Scheduler for Strong Fairness
- A self-stabilizing algorithm for detecting fundamental cycles in a graph
- Fault-containing self-stabilization using priority scheduling
This page was built for publication: A self-stabilizing algorithm for strong fairness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1387705)