Two absolute bounds for distributed bit complexity

DOI10.1016/J.TCS.2007.04.027zbMath1126.68013OpenAlexW2177472337MaRDI QIDQ2382670

Noam Solomon

Publication date: 2 October 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.027

zbMATH Keywords

distributed computingleader electionabsolute boundbit complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Related Items (1)

Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds

Cites Work

• Exact communication costs for consensus and leader in a tree
• Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
• Bit complexity of breaking and achieving symmetry in chains and rings
• Communication Complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two absolute bounds for distributed bit complexity