The following pages link to Token systems that self-stabilize (Q5375479):
Displayed 21 items.
- A self-stabilizing algorithm for the shortest path problem assuming the distributed demon (Q815255) (← links)
- Probabilistic self-stabilization (Q911752) (← links)
- Stabilizing unison (Q915420) (← links)
- Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model (Q1003766) (← links)
- A self-stabilizing algorithm for constructing spanning trees (Q1182088) (← links)
- Binary self-stabilization in distributed systems (Q1183462) (← links)
- A self-stabilizing algorithm for constructing breadth-first trees (Q1186586) (← links)
- A distributed self-stabilizing solution to the dining philosophers problem (Q1190517) (← links)
- A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments (Q1274286) (← links)
- A self-stabilizing distributed algorithm to find the median of a tree graph (Q1305938) (← links)
- The local detection paradigm and its applications to self-stabilization (Q1389769) (← links)
- A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph (Q1608394) (← links)
- A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph (Q1903205) (← links)
- Game theoretic analysis of self-stabilizing systems on arrays (Q2239175) (← links)
- A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model (Q2460592) (← links)
- An optimal self-stabilizing strarvation-free alternator (Q2575834) (← links)
- Self-stabilizing multi-token rings (Q5136988) (← links)
- Self-stabilizing token circulation in uniform networks (Q5137340) (← links)
- Self-stabilizing depth-first token circulation in arbitrary rooted networks (Q5137905) (← links)
- The triumph and tribulation of system stabilization (Q6062512) (← links)
- Self-stabilization of wait-free shared memory objects (Q6084562) (← links)