On the expected time for Herman's probabilistic self-stabilizing algorithm
From MaRDI portal
(Redirected from Publication:817822)
Recommendations
- Computing and Combinatorics
- A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
- 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
- Probabilistic verification of Herman's self-stabilisation algorithm
- Computing the fault-containment time of self-stabilizing algorithms using Markov chains and lumping
- Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains
- scientific article; zbMATH DE number 2061546
- Pseudodeterministic algorithms and the structure of probabilistic time
- Making randomized algorithms self-stabilizing
Cites work
- scientific article; zbMATH DE number 524141 (Why is no real title available?)
- A Simple Proof of 1 + 1 2 2 + 1 3 2 + ⋯ = π 2 6 and Related Identities
- A more rapidly mixing Markov chain for graph colorings
- A simple coupling of renewal processes
- Coalescing times for IID random variables with applications to population biology
- Collisions Among Random Walks on a Graph
- Convergence of the Iterated Prisoner's Dilemma Game
- Coupling and Self-stabilization
- Distributed probabilistic polling and applications to proportionate agreement
- Maximum hitting time for random walks on graphs
- Probabilistic self-stabilization
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
Cited in
(15)- Bounds on Herman's algorithm
- Probabilistic verification of Herman's self-stabilisation algorithm
- An elementary proof that Herman's ring is \(\Theta (N^{2})\)
- A tighter bound for the self-stabilization time in Herman's algorithm
- On stabilization in Herman's algorithm
- Three tokens in Herman's algorithm
- Coupling and self-stabilization
- Probabilistic self-stabilization
- Synthesizing optimal bias in randomized self-stabilization
- scientific article; zbMATH DE number 2006656 (Why is no real title available?)
- Proving the Herman-protocol conjecture
- Computing and Combinatorics
- A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
- A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
- Coupling and Self-stabilization
This page was built for publication: On the expected time for Herman's probabilistic self-stabilizing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817822)
