Optimized silent self-stabilizing scheme for tree-based constructions
From MaRDI portal
Publication:2072099
DOI10.1007/s00453-021-00878-9OpenAlexW3213805120MaRDI QIDQ2072099
Stéphane Devismes, Colette Johnen, David Ilcinkas
Publication date: 1 February 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00878-9
spanning treedistributed algorithmsself-stabilizationleader electionspace complexityspanning foreststabilization time
Algorithms in computer science (68Wxx) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Graph theory (05Cxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The expressive power of snap-stabilization
- Competitive self-stabilizing \(k\)-clustering
- Self-stabilizing leader election in polynomial steps
- An \(O(n)\)-time self-stabilizing leader election algorithm
- Self-stabilizing leader election in optimal space under an arbitrary scheduler
- A self-stabilizing algorithm for constructing breadth-first trees
- Self-stabilizing extensions for message-passing systems
- Self-stabilizing depth-first search
- Memory requirements for silent stabilization
- Proof labeling schemes
- The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction
- Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps
- Distributed network protocols
- A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm
- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
- The Conic toolkit for building distributed systems
- Self-stabilizing systems in spite of distributed control
- Self-stabilization with r-operators
- Universal dynamic synchronous self-stabilization
- A Snap-Stabilizing DFS with a Lower Space Requirement
- Self-stabilization with r-Operators Revisited
- Introduction to Distributed Self-Stabilizing Algorithms
- Parallel Processing and Applied Mathematics
- Snap-stabilizing tasks in anonymous networks
This page was built for publication: Optimized silent self-stabilizing scheme for tree-based constructions
