AN EFFICIENT ALGORITHM FOR BYZANTINE AGREEMENT WITHOUT AUTHENTICATION

[1] Dolev D., 1981, 22nd Annual Symposium on Foundations of Computer Science, P159, DOI 10.1109/SFCS.1981.53

[2] DOLEV D, 1982, 14TH P ACM SIGACT S

[3] DOLEV D, 1982, J ALGORITHMS, V3

[4] DOLEV D, 1983, UNPUB SCI IND APPL M

[5] THE BYZANTINE GENERALS PROBLEM [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (03): : 382 - 401

[6] LAMPORT L, 1983, UNPUB ACM T PROGRAMM

[7] LYNCH N, 1983, UNPUB LOWER BOUND TI

[8] LYNCH NAD, 1982, 14TH P ACM SIGACT S

[9] REACHING AGREEMENT IN THE PRESENCE OF FAULTS [J]. JOURNAL OF THE ACM, 1980, 27 (02) : 228 - 234

[1] Dolev D., 1981, 22nd Annual Symposium on Foundations of Computer Science, P159, DOI 10.1109/SFCS.1981.53

[2] DOLEV D, 1982, 14TH P ACM SIGACT S

[3] DOLEV D, 1982, J ALGORITHMS, V3

[4] DOLEV D, 1983, UNPUB SCI IND APPL M

[5] THE BYZANTINE GENERALS PROBLEM [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (03): : 382 - 401

[6] LAMPORT L, 1983, UNPUB ACM T PROGRAMM

[7] LYNCH N, 1983, UNPUB LOWER BOUND TI

[8] LYNCH NAD, 1982, 14TH P ACM SIGACT S

[9] REACHING AGREEMENT IN THE PRESENCE OF FAULTS [J]. JOURNAL OF THE ACM, 1980, 27 (02) : 228 - 234