Stabilizing unison
From MaRDI portal
DOI10.1016/0020-0190(90)90020-XzbMATH Open0702.68026OpenAlexW2914863966MaRDI QIDQ915420FDOQ915420
Authors: Mohamed G. Gouda, Ted Herman 
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90020-x
Recommendations
Cites Work
Cited In (24)
- On the microscopic view of time and messages
- SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS
- On self-stabilizing wait-free clock synchronization
- Synchronous vs. Asynchronous Unison
- Global synchronization of pulse-coupled oscillators on trees
- Unison, canon, and sluggish clocks in networks controlled by a synchronizer
- SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE
- Four-state stabilizing phase clock for unidirectional rings of odd size
- A self-stabilizing algorithm for detecting fundamental cycles in a graph
- Efficient counting with optimal resilience
- A self-stabilizing algorithm for the maximum flow problem
- Stabilizing phase-clocks
- Parallel composition for time-to-fault adaptive stabilization
- A self-stabilizing algorithm for maximal matching
- Self-stabilizing Byzantine asynchronous unison
- Dynamic FTSS in asynchronous systems: the case of unison
- A self-stabilizing distributed algorithm to find the median of a tree graph
- Essential unifiers
- A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
- Self-stabilizing synchronous unison in directed networks
- A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
- Synchronous vs. asynchronous unison
- A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
- A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
This page was built for publication: Stabilizing unison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915420)
