On the expected time for Herman's probabilistic self-stabilizing algorithm
From MaRDI portal
Publication:817822
DOI10.1016/J.TCS.2005.05.022zbMATH Open1086.68020OpenAlexW1967465461MaRDI QIDQ817822FDOQ817822
Authors: Toshio Nakata 
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.05.022
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
- Self-stabilization
- Maximum hitting time for random walks on graphs
- Self-stabilizing systems in spite of distributed control
- A more rapidly mixing Markov chain for graph colorings
- Probabilistic self-stabilization
- A simple coupling of renewal processes
- Collisions Among Random Walks on a Graph
- Coalescing times for IID random variables with applications to population biology
- Distributed probabilistic polling and applications to proportionate agreement
- Convergence of the Iterated Prisoner's Dilemma Game
- A Simple Proof of 1 + 1 2 2 + 1 3 2 + ⋯ = π 2 6 and Related Identities
- Title not available (Why is that?)
- Coupling and Self-stabilization
Cited In (11)
- 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
- Probabilistic self-stabilization
- Title not available (Why is that?)
- Computing and Combinatorics
- 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)
