ON THE MINIMAL SYNCHRONISM NEEDED FOR DISTRIBUTED CONSENSUS

[1] AGHILI H, 1983, RJ3755 IBM RES DIV R

[2] ATTIYA C, 1984, 3RD P ANN ACM S PRIN, P119

[3] BENOR M, 1983, 2ND P ANN ACM S PRIN, P27

[4] BENOR M, 1985, 4TH P ANN ACM S PRIN, P149

[5] BRACHA G, 1984, 3RD P ANN ACM S PRIN, P154

[6] Dolev D., 1982, 23rd Annual Symposium on Foundations of Computer Science, P196, DOI 10.1109/SFCS.1982.51

[7] AUTHENTICATED ALGORITHMS FOR BYZANTINE AGREEMENT [J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 656 - 666

[8] DOLEV D, 1982, AUG P ACM SIGACT SIG, P132

[9] DWORK C, 1985, RJ4892 IBM RES DIV R

[10] IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS [J]. JOURNAL OF THE ACM, 1985, 32 (02) : 374 - 382

[1] AGHILI H, 1983, RJ3755 IBM RES DIV R

[2] ATTIYA C, 1984, 3RD P ANN ACM S PRIN, P119

[3] BENOR M, 1983, 2ND P ANN ACM S PRIN, P27

[4] BENOR M, 1985, 4TH P ANN ACM S PRIN, P149

[5] BRACHA G, 1984, 3RD P ANN ACM S PRIN, P154

[6] Dolev D., 1982, 23rd Annual Symposium on Foundations of Computer Science, P196, DOI 10.1109/SFCS.1982.51

[7] AUTHENTICATED ALGORITHMS FOR BYZANTINE AGREEMENT [J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 656 - 666

[8] DOLEV D, 1982, AUG P ACM SIGACT SIG, P132

[9] DWORK C, 1985, RJ4892 IBM RES DIV R

[10] IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS [J]. JOURNAL OF THE ACM, 1985, 32 (02) : 374 - 382