Exact communication costs for consensus and leader in a tree

DOI10.1016/S1570-8667(03)00024-8zbMATH Open1074.68003OpenAlexW1971367832MaRDI QIDQ1827285FDOQ1827285

Authors: Shlomo Moran, Sergio Rajsbaum, Yefim Dinitz 

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

Recommendations

• Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
• Bit complexity of breaking and achieving symmetry in chains and rings
• Structural Information and Communication Complexity
• Two absolute bounds for distributed bit complexity
• Communication complexity of consensus in anonymous message passing systems

zbMATH Keywords

complexityDistributed computingLeader electionConsensusCommunication complexityBit complexityMessage

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

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

Cited In (1)

• Two absolute bounds for distributed bit complexity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827285)