A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman’s Algorithm

DOI10.1007/978-3-662-44584-6_24zbMath1417.68296OpenAlexW392480222MaRDI QIDQ3190128

Yuan Feng, Li-jun Zhang

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10453/33131

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

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