Author:
Widder Josef,Biely Martin,Gridling Günther,Weiss Bettina,Blanquart Jean-Paul
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference51 articles.
1. Charron-Bost B., Schiper A.: Uniform consensus is harder than consensus. J. Algorithms 51(1), 15–37 (2004)
2. Delporte-Gallet, C., Fauconnier, H., Horn, S.L., Toueg, S.: Fast fault-tolerant agreement algorithms. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC’05), pp. 169–178. ACM Press, New York, USA (2005)
3. Lynch N.: Distributed Algorithms. Morgan Kaufman Publishers, San Francisco (1996)
4. Lamport L., Shostak R., Pease M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)
5. Nesterenko, M., Arora, A.: Dining philosophers that tolerate malicious crashes. In: Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS’02), pp. 191–198. Vienna, Austria (2002)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献