Bit complexity of breaking and achieving symmetry in chains and rings. (English summary) J. ACM 55 (2008), no. 1, Art. 3, 28 pp. The authors study the communication costs of three tasks in chain and ring topologies. The message complexities of these tasks (Consensus, Leader, MaxF) are all the same. For the bit complexity several new lower bounds are provided which yield (almost) tight results for the two-processor case and a chain. Further, some modifications are considered. Reviewed by Ulrich Tam
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.