Optimal early stopping in distributed consensus-Reference-Cited by-同舟云学术

Optimal early stopping in distributed consensus

Published:1992 Issue: Volume: Page:221-237
ISSN:0302-9743
Container-title:Distributed Algorithms
language:
Short-container-title:

Author:

Berman Piotr,Garay Juan A.,Perry Kenneth J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56188-9_15

Reference17 articles.

1. A. Bar-Noy, D. Dolev, C. Dwork and H.R. Strong, “Shifting gears: changing algorithms on the fly to expedite Byzantine Agreement,” Proc. 6th PODC, pp. 42–51, August 1987.

2. P. Berman and J.A. Garay, “Asymptotically Optimal Distributed Consensus,” Proc. ICALP 89, LNCS Vol. 372, pp. 80–94, July 1989.

3. P. Berman and J.A. Garay, “Distributed Consensus with n = (3 + ε)t Processors,” Proc. 5th International Workshop on Dist. Algorithms, LNCS, Springer-Verlag, October 1991.

4. P. Berman, J.A. Garay and K.J. Perry, “Towards Optimal Distributed Consensus,” Proc. 30th FOCS, pp. 410–415, October/November 1989.

5. B. Coan, “Efficient agreement using fault diagnosis,” Proc. 26th Allerton Conf. on Comm., Control and Computing, pp. 663–672, 1988.

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

1. Early Stopping for Any Number of Corruptions;Lecture Notes in Computer Science;2024

2. Byzantine Agreement;Encyclopedia of Cryptography, Security and Privacy;2023-09-21

3. Optimistic Fast Confirmation While Tolerating Malicious Majority in Blockchains;2023 IEEE Symposium on Security and Privacy (SP);2023-05

4. Reaching Efficient Byzantine Agreements in Bipartite Networks;IEEE Access;2022

5. Optimistically tuning synchronous byzantine consensus: another win for null messages;Distributed Computing;2021-06-10