Author:
Berman Piotr,Garay Juan A.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. B. Bollobás, "Random Graphs," combinatorics, London Math. Society LN 52, Cambridge University Press, 1981, pp. 80–102.
2. A. Bar-Noy and D. Dolev, "Families of Consensus Algorithms," Proc. 3rd Aegean Workshop on Computing, June/July 1988, pp. 380–390.
3. 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, August 1987, pp. 42–51.
4. P. Berman and J.A. Garay, "Asymptotically Optimal Distributed Consensus," Proc. ICALP 89, LNCS, Vol. 372, July 1989, pp. 80–94.
5. P. Berman, J.A. Garay and K.J. Perry, "Towards Optimal Distributed Consensus," Proc. 30th FOCS, October 1989, pp. 410–415.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献