Asynchronous self-stabilization made fast, simple, and energy-efficient
From MaRDI portal
Cites work
- A self-stabilizing algorithm for constructing breadth-first trees
- An O(n)-time self-stabilizing leader election algorithm
- Impossibility of distributed consensus with one faulty process
- Introduction to Distributed Self-Stabilizing Algorithms
- Local stabilizer
- Locality in Distributed Graph Algorithms
- Memory requirements for silent stabilization
- Optimized silent self-stabilizing scheme for tree-based constructions
- Parallel Processing and Applied Mathematics
- Self-stabilization
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Self-stabilizing extensions for message-passing systems
- Self-stabilizing leader election in optimal space under an arbitrary scheduler
- Self-stabilizing leader election in polynomial steps
- Self-stabilizing systems in spite of distributed control
- Stone age distributed computing
- The cost of fault tolerance in multi-party communication complexity
- The first fully polynomial stabilizing algorithm for BFS tree construction
- The local detection paradigm and its applications to self-stabilization
- Time Optimal Asynchronous Self-stabilizing Spanning Tree
- Time optimal self-stabilizing synchronization
- Universal dynamic synchronous self-stabilization
Cited in
(1)
This page was built for publication: Asynchronous self-stabilization made fast, simple, and energy-efficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971903)
