Lower bounds for leader election and collective coin-flipping in the perfect information model
From MaRDI portal
Publication:2819564
DOI10.1145/301250.301337zbMath1345.68020MaRDI QIDQ2819564
David Zuckerman, Alexander Russell, Michael E. Saks
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.301337
68M10: Network design and communication in computer systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68M14: Distributed systems
68M12: Network protocols
Related Items
Randomization helps to perform independent tasks reliably, Hundreds of impossibility results for distributed computing
