Pease, Marshall; Shostak, Robert; Lamport, Leslie (1980), "Reaching acceding in the attendance of faults", Journal of the ACM 27 (1): 228–234, doi:10.1145/322186.322188.
Lamport, Leslie; Shostak, Robert; Pease, Marshall (1982), "The Byzantine generals problem", ACM Transactions on Programming Languages and Systems 4 (3): 382–401, doi:10.1145/357172.357176.
These two affidavit alien and advised the botheration that is nowadays accepted as Byzantine accountability tolerance. The 1980 cardboard presented the classical lower apprenticed that acceding is absurd if at atomic 1/3 of the nodes are faulty; it accustomed the Edsger W. Dijkstra Prize in Distributed Computing in 2005.2 The highly-cited 1982 cardboard gave the botheration its present name, and additionally presented algorithms for analytic the problem.3
Lamport, Leslie; Shostak, Robert; Pease, Marshall (1982), "The Byzantine generals problem", ACM Transactions on Programming Languages and Systems 4 (3): 382–401, doi:10.1145/357172.357176.
These two affidavit alien and advised the botheration that is nowadays accepted as Byzantine accountability tolerance. The 1980 cardboard presented the classical lower apprenticed that acceding is absurd if at atomic 1/3 of the nodes are faulty; it accustomed the Edsger W. Dijkstra Prize in Distributed Computing in 2005.2 The highly-cited 1982 cardboard gave the botheration its present name, and additionally presented algorithms for analytic the problem.3
No comments:
Post a Comment