Self-stabilizing silent disjunction in an anonymous network
From MaRDI portal
(Redirected from Publication:507596)
Recommendations
- Self-stabilizing silent disjunction in an anonymous network
- An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks
- Self-stabilization with r-Operators Revisited
- Self-stabilizing leader election in polynomial steps
- Self-stabilizing weak leader election in anonymous trees using constant memory per edge
Cites work
- scientific article; zbMATH DE number 1332668 (Why is no real title available?)
- scientific article; zbMATH DE number 1332672 (Why is no real title available?)
- A self-stabilizing \(k\)-clustering algorithm for weighted graphs
- A self-stabilizing algorithm for constructing breadth-first trees
- A self-stabilizing algorithm for constructing spanning trees
- An O(n)-time self-stabilizing leader election algorithm
- Competitive self-stabilizing \(k\)-clustering
- Distributed reset
- Fast, silent self-stabilizing distance-\(k\) independent dominating set construction
- Memory requirements for silent stabilization
- Self-stabilization
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Self-stabilizing depth-first search
- Self-stabilizing leader election in optimal space under an arbitrary scheduler
- Self-stabilizing leader election in polynomial steps
- Self-stabilizing silent disjunction in an anonymous network
- Self-stabilizing systems in spite of distributed control
- The first fully polynomial stabilizing algorithm for BFS tree construction
- Time Optimal Asynchronous Self-stabilizing Spanning Tree
- Time optimal self-stabilizing synchronization
Cited in
(3)
This page was built for publication: Self-stabilizing silent disjunction in an anonymous network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507596)