-
2
-
-
0027225071
-
Generalized FLP impossibility result for t-resilient asynchronous computations
-
ACM Press, New York
-
Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the 25th ACM Symposium on Theory of Computing, pp. 91-100. ACM Press, New York (1993)
-
(1993)
Proceedings of the 25th ACM Symposium on Theory of Computing
, pp. 91-100
-
-
Borowsky, E.1
Gafni2
-
3
-
-
0030197368
-
The weakest failure detector for solving consensus
-
4
-
T.D. Chandra V. Hadzilacos S. Toueg 1996 The weakest failure detector for solving consensus J. ACM 43 4 685 722
-
(1996)
J. ACM
, vol.43
, pp. 685-722
-
-
Chandra, T.D.1
Hadzilacos, V.2
Toueg, S.3
-
4
-
-
0030102105
-
Unreliable failure detectors for reliable distributed systems
-
2
-
T.D. Chandra S. Toueg 1996 Unreliable failure detectors for reliable distributed systems J. ACM 43 2 225 267
-
(1996)
J. ACM
, vol.43
, pp. 225-267
-
-
Chandra, T.D.1
Toueg, S.2
-
5
-
-
0001197842
-
More choices allow more faults: Set consensus problems in totally asynchronous systems
-
1
-
S. Chaudhuri 1993 More choices allow more faults: set consensus problems in totally asynchronous systems Inf. Comput. 105 1 132 158
-
(1993)
Inf. Comput.
, vol.105
, pp. 132-158
-
-
Chaudhuri, S.1
-
6
-
-
38049077532
-
Weakening failure detectors for k-set agreement via the partition approach
-
Chen, W., Zhang, J., Chen, Y., Liu, X.: Weakening failure detectors for k-set agreement via the partition approach. In: Proceedings of the 21st International Symposium on Distributed Computing, pp. 123-138 (2007)
-
(2007)
Proceedings of the 21st International Symposium on Distributed Computing
, pp. 123-138
-
-
Chen, W.1
Zhang, J.2
Chen, Y.3
Liu4
-
7
-
-
10444236388
-
The weakest failure detectors to solve certain fundamental problems in distributed computing
-
Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Koutnetzov, P., Toueg, S.: The weakest failure detectors to solve certain fundamental problems in distributed computing. In: Proceedings of the 23th ACM Symposium on Principles of Distributed Computing (2004)
-
(2004)
Proceedings of the 23th ACM Symposium on Principles of Distributed Computing
-
-
Delporte-Gallet, C.1
Fauconnier, H.2
Guerraoui, R.3
Hadzilacos, V.4
Koutnetzov, P.5
Toueg6
-
9
-
-
0023168356
-
On the minimal synchronism needed for distributed consensus
-
1
-
D. Dolev C. Dwork L. Stockmeyer 1987 On the minimal synchronism needed for distributed consensus J. ACM 34 1 77 97
-
(1987)
J. ACM
, vol.34
, pp. 77-97
-
-
Dolev, D.1
Dwork, C.2
Stockmeyer, L.3
-
10
-
-
0023994903
-
Consensus in the presence of partial synchrony
-
2
-
C. Dwork N.A. Lynch L. Stockmeyer 1988 Consensus in the presence of partial synchrony J. ACM 35 2 288 323
-
(1988)
J. ACM
, vol.35
, pp. 288-323
-
-
Dwork, C.1
Lynch, N.A.2
Stockmeyer, L.3
-
11
-
-
0022045868
-
Impossibility of distributed consensus with one faulty process
-
2
-
M.J. Fischer N.A. Lynch M.S. Paterson 1985 Impossibility of distributed consensus with one faulty process J. ACM 32 2 374 382
-
(1985)
J. ACM
, vol.32
, pp. 374-382
-
-
Fischer, M.J.1
Lynch, N.A.2
Paterson, M.S.3
-
12
-
-
36849049248
-
On the weakest failure detector ever
-
Guerraoui, R., Herlihy, M., Kouznetsov, P., Lynch, N.A., Newport, C.C.: On the weakest failure detector ever. In: Proceedings of the 26th ACM Symposium on Principles of Distributed Computing, pp. 235-243 (2007)
-
(2007)
Proceedings of the 26th ACM Symposium on Principles of Distributed Computing
, pp. 235-243
-
-
Guerraoui, R.1
Herlihy, M.2
Kouznetsov, P.3
Lynch, N.A.4
Newport, C.5
-
15
-
-
0025460579
-
Linearizability: A correctness condition for concurrent objects
-
3
-
M. Herlihy J.M. Wing 1990 Linearizability: a correctness condition for concurrent objects ACM Trans. Program. Lang. Syst. 12 3 463 492
-
(1990)
ACM Trans. Program. Lang. Syst.
, vol.12
, pp. 463-492
-
-
Herlihy, M.1
Wing, J.M.2
-
16
-
-
0031176479
-
Robust wait-free hierarchies
-
4
-
P. Jayanti 1997 Robust wait-free hierarchies J. ACM 44 4 592 614
-
(1997)
J. ACM
, vol.44
, pp. 592-614
-
-
Jayanti, P.1
-
20
-
-
0027188179
-
Wait-free k-set agreement is impossible: The topology of public knowledge
-
ACM Press, New York
-
Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: the topology of public knowledge. In: Proceedings of the 25th ACM Symposium on Theory of Computing, pp. 101-110. ACM Press, New York (1993)
-
(1993)
Proceedings of the 25th ACM Symposium on Theory of Computing
, pp. 101-110
-
-
Saks, M.1
Zaharoglou2
|