Self-stabilizing leader election in polynomial steps
DOI10.1016/J.IC.2016.09.002zbMATH Open1370.68026OpenAlexW2506785934MaRDI QIDQ528197FDOQ528197
Alain Cournier, Karine Altisen, Stéphane Devismes, Franck Petit, Anaïs Durand
Publication date: 12 May 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://hal.sorbonne-universite.fr/hal-01347471/file/main.pdf
Recommendations
- Self-stabilizing leader election in optimal space under an arbitrary scheduler
- An \(O(n)\)-time self-stabilizing leader election algorithm
- Self-stabilizing leader election in dynamic networks
- Self-stabilizing weak leader election in anonymous trees using constant memory per edge
- SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Self-stabilization
- Distributed network protocols
- Self-stabilizing systems in spite of distributed control
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Time optimal self-stabilizing synchronization
- An \(O(n)\)-time self-stabilizing leader election algorithm
- Memory requirements for silent stabilization
- Time Optimal Asynchronous Self-stabilizing Spanning Tree
- Distributed reset
- Self-stabilizing leader election in optimal space under an arbitrary scheduler
Cited In (11)
- Near-optimal knowledge-free resilient leader election
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem
- SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE
- Title not available (Why is that?)
- The first fully polynomial stabilizing algorithm for BFS tree construction
- Optimized silent self-stabilizing scheme for tree-based constructions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Self-stabilizing silent disjunction in an anonymous network
- Self-stabilizing systems in spite of high dynamics
- ANALYSIS OF THE AVERAGE EXECUTION TIME FOR A SELF-STABILIZING LEADER ELECTION ALGORITHM
This page was built for publication: Self-stabilizing leader election in polynomial steps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528197)
