TY - JOUR AB - We study the expected self-stabilization time of Herman's algorithm. For N processors the lower bound is 427N2 (0.148N2), and an upper bound of 0.64N2 is presented in Kiefer et al. (2011) [4]. In this paper we give a tighter upper bound 0.521N2. © 2013 Published by Elsevier B.V. AU - Feng, Y AU - Zhang, L DA - 2013/04/29 DO - 10.1016/j.ipl.2013.04.006 EP - 488 JO - Information Processing Letters PY - 2013/04/29 SP - 486 TI - A tighter bound for the self-stabilization time in Herman's algorithm VL - 113 Y1 - 2013/04/29 Y2 - 2024/03/28 ER -