Easy impossibility proofs for distributed consensus problems-Reference-Cited by-同舟云学术

Easy impossibility proofs for distributed consensus problems

Published:1986-03 Issue:1 Volume:1 Page:26-39
ISSN:0178-2770
Container-title:Distributed Computing
language:en
Short-container-title:Distrib Comput

Author:

Fischer Michael J.,Lynch Nancy A.,Merritt Michael

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01843568.pdf

Reference12 articles.

1. Angluin D (1980) Local and global properties in networks of processors. Proceedings of the 12th STOC, April 30–May 2, 1980, Los Angeles, CA, pp 82–93

2. Burns J (1980) A formal model for message passing systems, TR-91, Indiana University, Sept

3. Burns J, Lynch N (1984) The byzantine firing squad problem, (submitted for publication)

4. Coan B, Dolev D, Dwork C, Stockmeyer L (1985) The distributed firing squad problem, Proceedings of the 17th STOC, May 6–8, 1985, Providence, RI

5. Dolev D (1982) The byzantine generals strike again. J Algorithms 3:14–30

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

1. MBFT: A Modular Byzantine Fault Tolerance Protocol for high adaptability;Expert Systems with Applications;2024-12

2. Experimental quantum Byzantine agreement on a three-user quantum network with integrated photonics;Science Advances;2024-08-23

3. Optimal Load-Balanced Scalable Distributed Agreement;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. Quasi‐majority functional voting on expander graphs;Random Structures & Algorithms;2024-05-21

5. Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection;Journal of the ACM;2024-04-12