Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
From MaRDI portal
Publication:2819553
DOI10.1145/301250.301314zbMath1345.68014OpenAlexW2051192605MaRDI QIDQ2819553
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301314
Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (2)
Two absolute bounds for distributed bit complexity ⋮ Exact communication costs for consensus and leader in a tree
This page was built for publication: Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
