A LOWER BOUND FOR THE TIME TO ASSURE INTERACTIVE CONSISTENCY

[1] DAVIES D, 1978, IEEE T COMPUT, V27, P531, DOI 10.1109/TC.1978.1675144

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

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

[4] LAMPORT L, 1982, J ALGORITHMS, V3

[5] LAMPORT L, UNPUB ACM T PROGRAMM

[6] ON DESCRIBING THE BEHAVIOR AND IMPLEMENTATION OF DISTRIBUTED SYSTEMS [J]. THEORETICAL COMPUTER SCIENCE, 1981, 13 (01) : 17 - 43

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

[1] DAVIES D, 1978, IEEE T COMPUT, V27, P531, DOI 10.1109/TC.1978.1675144

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

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

[4] LAMPORT L, 1982, J ALGORITHMS, V3

[5] LAMPORT L, UNPUB ACM T PROGRAMM

[6] ON DESCRIBING THE BEHAVIOR AND IMPLEMENTATION OF DISTRIBUTED SYSTEMS [J]. THEORETICAL COMPUTER SCIENCE, 1981, 13 (01) : 17 - 43

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