Publisher
Morgan & Claypool Publishers LLC
Reference66 articles.
1. Atomic snapshots of shared memory
2. Yehuda Afek, Eytan Weisberger, and Hanan Weisman. A completeness theorem for a class of synchronization objects. InProceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, pages159-170, 1993. DOI: 10.1145/164051.164071.10.1145/164051.164071
3. A simple bivalency proof that -resilient consensus requires rounds
4. Proofs from THE BOOK
5. Average and Randomized Complexity of Distributed Problems
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Determining Recoverable Consensus Numbers;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
2. The Space Complexity of Consensus from Swap;Journal of the ACM;2023-11-02
3. A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20
4. The Space Complexity of Consensus from Swap;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20
5. The Space Complexity of Scannable Binary Objects;Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing;2021-07-21