Self-stabilizing synchronous unison in directed networks
From MaRDI portal
Publication:6499546
DOI10.1016/J.TCS.2024.114577MaRDI QIDQ6499546FDOQ6499546
Authors: Karine Altisen, Alain Cournier, Geoffrey Defalque, Stéphane Devismes
Publication date: 8 May 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Self-stabilizing extensions for message-passing systems
- Self-stabilizing systems in spite of distributed control
- Title not available (Why is that?)
- Time optimal self-stabilizing synchronization
- A Snap-Stabilizing DFS with a Lower Space Requirement
- An \(O(n)\)-time self-stabilizing leader election algorithm
- Title not available (Why is that?)
- Stabilizing unison
- When graph theory helps self-stabilization
- Self-stabilizing \(2^m\)-clock for unidirectional rings of odd size
- Self-stabilizing depth-first search
- Title not available (Why is that?)
- The Distributed Firing Squad Problem
- Uniform and self-stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon
- Title not available (Why is that?)
- On probabilistic snap-stabilization
- Self-stabilizing group communication in directed networks
- Introduction to Distributed Self-Stabilizing Algorithms
This page was built for publication: Self-stabilizing synchronous unison in directed networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499546)