-
2
-
-
0030197368
-
The weakest failure detector for solving consensus
-
Chandra TD, Hadzilacos V, Toueg S: The weakest failure detector for solving consensus. J ACM 43(4): 685-722 (1996)
-
(1996)
J ACM
, vol.43
, Issue.4
, pp. 685-722
-
-
Chandra, T.D.1
Hadzilacos, V.2
Toueg, S.3
-
3
-
-
0030102105
-
Unreliable failure detectors for reliable distributed systems
-
Chandra TD, Toueg S: Unreliable failure detectors for reliable distributed systems. J ACM 43(2): 225-267 (1996). A preliminary version appeared in the Proeeedings of the Tenth ACM Symposium on Principles of Distributed Computing, pp 325-340. ACM Press, August 1991
-
(1996)
J ACM
, vol.43
, Issue.2
, pp. 225-267
-
-
Chandra, T.D.1
Toueg, S.2
-
4
-
-
0030102105
-
-
ACM Press, August
-
Chandra TD, Toueg S: Unreliable failure detectors for reliable distributed systems. J ACM 43(2): 225-267 (1996). A preliminary version appeared in the Proeeedings of the Tenth ACM Symposium on Principles of Distributed Computing, pp 325-340. ACM Press, August 1991
-
(1991)
Proeeedings of the Tenth ACM Symposium on Principles of Distributed Computing
, pp. 325-340
-
-
-
5
-
-
0012242251
-
Randomization in byzantine agreement
-
Micali S (ed) JAI Press
-
Chor B, Dwork C: Randomization in byzantine agreement. In: Micali S (ed) Advances in computing research, randomness in computation, vol 5, pp 443-497. JAI Press, 1989
-
(1989)
Advances in Computing Research, Randomness in Computation
, vol.5
, pp. 443-497
-
-
Chor, B.1
Dwork, C.2
-
6
-
-
0023168356
-
On the minimal synchrony needed for distributed consensus
-
Dolev D, Dwork C, Stockmeyer L: On the minimal synchrony needed for distributed consensus. J ACM 34(1): 77-97 (1987)
-
(1987)
J ACM
, vol.34
, Issue.1
, pp. 77-97
-
-
Dolev, D.1
Dwork, C.2
Stockmeyer, L.3
-
7
-
-
0023994903
-
Consensus in the presence of partial synchrony
-
Dwork C, Lynch N, Stoekmeyer L: Consensus in the presence of partial synchrony. J ACM 35(2): 288-323 (1988)
-
(1988)
J ACM
, vol.35
, Issue.2
, pp. 288-323
-
-
Dwork, C.1
Lynch, N.2
Stoekmeyer, L.3
-
8
-
-
0022045868
-
Impossibility of distributed consensus with one faulty process
-
Fischer M, Lynch N, Paterson M: Impossibility of distributed consensus with one faulty process. J ACM 32: 374-382 (1985)
-
(1985)
J ACM
, vol.32
, pp. 374-382
-
-
Fischer, M.1
Lynch, N.2
Paterson, M.3
-
9
-
-
84947902519
-
Revisiting the relationship between non-blocking atomic commitment and consensus
-
9th International Workshop on Distributed Algorithms (WDAG-9) Springer, Berlin Heidelberg New York
-
Guerraoui R: Revisiting the relationship between non-blocking atomic commitment and consensus. In: 9th International Workshop on Distributed Algorithms (WDAG-9) LNCS 972, pp 87-100. Springer, Berlin Heidelberg New York 1995
-
(1995)
LNCS
, vol.972
, pp. 87-100
-
-
Guerraoui, R.1
-
10
-
-
0003070483
-
Fault-tolerant broadcasts and related problems
-
Mullender S (ed) ACM Press
-
Hadzilacos V, Toueg S: Fault-tolerant broadcasts and related problems. In: Mullender S (ed) Distributed systems, pp 97-145. ACM Press, 1993
-
(1993)
Distributed Systems
, pp. 97-145
-
-
Hadzilacos, V.1
Toueg, S.2
-
11
-
-
0017996760
-
Time, clocks, and the ordering of events in a distributed system
-
Lamport L: Time, clocks, and the ordering of events in a distributed system. Commun ACM 21(7): 558-565 (1978)
-
(1978)
Commun ACM
, vol.21
, Issue.7
, pp. 558-565
-
-
Lamport, L.1
|