Author:
Angluin Dana,Fischer Michael J.,Jiang Hong
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. In: Suri, N., Walter, C.J., Hugue, M.M. (eds.) Advances in Ultra-Dependable Distributed Systems, IEEE Computer Society Press, Los Alamitos (1995)
2. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27, 228–234 (1980)
3. Dolev, D.: The byzantine generals strike again. Journal of Algorithms 3(1), 14–30 (1982)
4. Dolev, D., Strong, H.R.: Polynomial algorithms for multiple processor agreement. In: Proceedings of the 14th annual ACM symposium on Theory of computing, San Francisco, California, United States, pp. 401–407 (1982)
5. Dolev, D., Fischer, M.J., Fowler, R., Lynch, N.A., Strong, H.R.: An efficient algorithm for byzantine agreement without authentication. Information and Control 52(3), 257–274 (1982)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献