Exact communication costs for consensus and leader in a tree

DOI10.1016/S1570-8667(03)00024-8zbMath1074.68003OpenAlexW1971367832MaRDI QIDQ1827285

Sergio Rajsbaum, Shlomo Moran

Publication date: 6 August 2004

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1570-8667(03)00024-8

zbMATH Keywords

complexityDistributed computingLeader electionConsensusCommunication complexityBit complexityMessage

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (1)

Two absolute bounds for distributed bit complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the total\(_k\)-diameter of connection networks
• Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
• Distributed network protocols
• Distributed algorithms for finding centers and medians in networks
• Lower bounds on communication complexity in distributed computer networks
• Impossibility of distributed consensus with one faulty process
• Decentralized extrema-finding in circular configurations of processors
• Communication Complexity

This page was built for publication: Exact communication costs for consensus and leader in a tree