A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
From MaRDI portal
(Redirected from Publication:498668)
Recommendations
Cites work
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
- A tighter bound for the self-stabilization time in Herman's algorithm
- An elementary proof that Herman's ring is \(\Theta (N^{2})\)
- Coupling and self-stabilization
- Diffusion-reaction in one dimension
- Interacting particle systems. With a new postface.
- On stabilization in Herman's algorithm
- On the expected time for Herman's probabilistic self-stabilizing algorithm
- Probabilistic self-stabilization
- Probabilistic verification of Herman's self-stabilisation algorithm
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- Three tokens in Herman's algorithm
Cited in
(7)- Probabilistic verification of Herman's self-stabilisation algorithm
- On the expected time for Herman's probabilistic self-stabilizing algorithm
- Computing the fault-containment time of self-stabilizing algorithms using Markov chains and lumping
- A tighter bound for the self-stabilization time in Herman's algorithm
- Synthesizing optimal bias in randomized self-stabilization
- Computing and Combinatorics
- A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
This page was built for publication: A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498668)
