The following pages link to Bounds on Herman's algorithm (Q401316):
Displaying 7 items.
- A nearly optimal upper bound for the self-stabilization time in Herman's algorithm (Q498668) (← links)
- Faster algorithms for computing Hong's bound on absolute positiveness (Q972846) (← links)
- An elementary proof that Herman's ring is \(\Theta (N^{2})\) (Q1041727) (← links)
- Probabilistic verification of Herman's self-stabilisation algorithm (Q1941879) (← links)
- Three tokens in Herman's algorithm (Q1941880) (← links)
- A tighter bound for the self-stabilization time in Herman's algorithm (Q2444741) (← links)
- Computing and Combinatorics (Q4681204) (← links)
