Dinitz, Yefim; Moran, Shlomo; Rajsbaum, Sergio Bit complexity of breaking and achieving symmetry in chains and rings. (English) Zbl 1326.68035 J. ACM 55, No. 1, Article No. 3, 28 p. (2008). Cited in 13 Documents MSC: 68M10 Network design and communication in computer systems 68M14 Distributed systems Keywords:distributed computing; communication complexity; communication cost; message complexity; bit complexity; consensus; leader election; processor chain; processor ring; tight bound; lower bounds; symmetric synchronous execution Citations:Zbl 0993.68500 PDFBibTeX XMLCite \textit{Y. Dinitz} et al., J. ACM 55, No. 1, Article No. 3, 28 p. (2008; Zbl 1326.68035) Full Text: DOI