Skip to main content
Article thumbnail
Location of Repository

recent references are

By Mr (b: M, Yefim (il-bgun-c) Moran and Rajsbaum Sergio (mex-nam-im


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

Topics: 1. Attiya, H, and Welch, J. 1998. Distributed Computing, Fundamentals, Simulations and Advanced
Year: 1769
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.