Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication-Reference-Cited by-同舟云学术

Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication

Published:2023-06-16 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Chlebus Bogdan¹^ORCID,Kowalski Dariusz Rafal¹^ORCID,Olkowski Jan²^ORCID

Affiliation:

1. Augusta University, Augusta, United States of America

2. University of Maryland, College Park, USA

Funder

NSF

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3583668.3594599

Reference39 articles.

1. Ittai Abraham , T.-H. Hubert Chan , Danny Dolev , Kartik Nayak , Rafael Pass , Ling Ren , and Elaine Shi . 2019 . Communication Complexity of Byzantine Agreement , Revisited. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC). ACM, 317--326 . Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2019. Communication Complexity of Byzantine Agreement, Revisited. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC). ACM, 317--326.

2. Communication-efficient randomized consensus;Alistarh Dan;Distributed Computing,2018

3. Randomized Consensus in Expected O(n log2 n) Operations Per Processor;Aspnes James;SIAM Journal of Computing,1996

4. Lower Bounds for Randomized Consensus under a Weak Adversary;Attiya Hagit;SIAM Journal of Computing,2010

5. Hagit Attiya and Faith Ellen . 2014. Impossibility Results for Distributed Computing . Morgan & Claypool Publishers . Hagit Attiya and Faith Ellen. 2014. Impossibility Results for Distributed Computing. Morgan & Claypool Publishers.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sparse Spanners with Small Distance and Congestion Stretches;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

3. All Byzantine Agreement Problems Are Expensive;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17