Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, and H. Raymond Strong. Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC), pages 42–51, Vancouver, Canada, 1987.
2. Malte Borcherding. Efficient failure discovery with limited authentication. In Proceedings of the 15th International Conference on Distributed Computing Systems (ICDCS), pages 78–82, Vancouver, Canada, 1995. IEEE Computer Society Press.
3. Danny Dolev. The Byzantine generals strike again. Journal of Algorithms, 3(1):14–30, 1982.
4. Danny Dolev and Raymond Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal of Computing, 12(5):656–666, November 1983.
5. Klaus Echtle and Asif Masum. A mutiple bus braodcast protocol resilient to non-cooperative Byzantine faults. In Proceedings of the 26th International Symposium on Fault-Tolerant Computing (FTCS). IEEE Computer Society Press, 1996.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献