-
1
-
-
38249028223
-
Explicit construction of linear sized tolerant networks
-
N. Alon, and F. Chung Explicit construction of linear sized tolerant networks Discrete Math. 72 1988 15 19
-
(1988)
Discrete Math.
, vol.72
, pp. 15-19
-
-
Alon, N.1
Chung, F.2
-
2
-
-
37049009792
-
Scalable secure storage when half the system is faulty
-
N. Alon, H. Kaplan, M. Krivelevich, D. Malkhi, and J. Stern Scalable secure storage when half the system is faulty 27th Internat. Colloq. on Automata, Languages and Programming 2000 577 587
-
(2000)
27th Internat. Colloq. on Automata, Languages and Programming
, pp. 577-587
-
-
Alon, N.1
Kaplan, H.2
Krivelevich, M.3
Malkhi, D.4
Stern, J.5
-
4
-
-
0001757868
-
Algorithms for the certified Write-All problem
-
R.J. Anderson, and H. Woll Algorithms for the certified Write-All problem SIAM J. Comput. 26 5 1997 1277 1283
-
(1997)
SIAM J. Comput.
, vol.26
, Issue.5
, pp. 1277-1283
-
-
Anderson, R.J.1
Woll, H.2
-
5
-
-
0034893155
-
Performing tasks on restartable message-passing processors
-
B. Chlebus, R. De Prisco, and A.A. Shvartsman Performing tasks on restartable message-passing processors Distributed Comput. 14 1 2001 49 64
-
(2001)
Distributed Comput.
, vol.14
, Issue.1
, pp. 49-64
-
-
Chlebus, B.1
De Prisco, R.2
Shvartsman, A.A.3
-
6
-
-
84927949869
-
Bounding work and communication in robust cooperative computation
-
B.S. Chlebus, L. Gasieniec, D.R. Kowalski, A.A. Shvartsman, Bounding work and communication in robust cooperative computation, 16th Internat. Symp. on Distributed Computing, 2002, pp. 295-310.
-
(2002)
16th Internat. Symp. on Distributed Computing
, pp. 295-310
-
-
Chlebus, B.S.1
Gasieniec, L.2
Kowalski, D.R.3
Shvartsman, A.A.4
-
9
-
-
85012232388
-
Time-optimal message-efficient work performance in the presence of faults
-
R. De Prisco, A. Mayer, M. Yung, Time-optimal message-efficient work performance in the presence of faults, 13th Symp. on Principles of Distributed Computing, 1994, pp. 161-172.
-
(1994)
13th Symp. on Principles of Distributed Computing
, pp. 161-172
-
-
De Prisco, R.1
Mayer, A.2
Yung, M.3
-
10
-
-
0001280843
-
Performing work efficiently in the presence of faults
-
C. Dwork, J. Halpern, and O. Waarts Performing work efficiently in the presence of faults SIAM J. Comput. 27 5 1998 1457 1491
-
(1998)
SIAM J. Comput.
, vol.27
, Issue.5
, pp. 1457-1491
-
-
Dwork, C.1
Halpern, J.2
Waarts, O.3
-
11
-
-
0029510897
-
Resolving message complexity of byzantine agreement and beyond
-
Z. Galil, A. Mayer, M. Yung, Resolving message complexity of byzantine agreement and beyond, 36th Symp. on Foundations of Computer Science, 1995, pp. 724-733.
-
(1995)
36th Symp. on Foundations of Computer Science
, pp. 724-733
-
-
Galil, Z.1
Mayer, A.2
Yung, M.3
-
12
-
-
35248829130
-
Efficient gossip and robust distributed computation
-
Ch. Georgiou, D. Kowalski, A.A. Shvartsman, Efficient gossip and robust distributed computation, 17th Internat. Symp. on Distributed Computing, 2003, pp. 224-238.
-
(2003)
17th Internat. Symp. on Distributed Computing
, pp. 224-238
-
-
Georgiou, Ch.1
Kowalski, D.2
Shvartsman, A.A.3
-
13
-
-
1642377534
-
The complexity of synchronous iterative Do-All with crashes
-
Ch. Georgiou, A. Russell, and A.A. Shvartsman The complexity of synchronous iterative Do-All with crashes Distributed Comput. 17 1 2004 47 63
-
(2004)
Distributed Comput.
, vol.17
, Issue.1
, pp. 47-63
-
-
Georgiou, Ch.1
Russell, A.2
Shvartsman, A.A.3
-
14
-
-
0001853771
-
Efficient parallel algorithms can be made robust
-
P.C. Kanellakis, and A.A. Shvartsman Efficient parallel algorithms can be made robust Distributed Comput. 5 4 1992 201 217
-
(1992)
Distributed Comput.
, vol.5
, Issue.4
, pp. 201-217
-
-
Kanellakis, P.C.1
Shvartsman, A.A.2
-
17
-
-
0012614841
-
Fault-tolerant broadcasting and gossiping in communication networks
-
A. Pelc Fault-tolerant broadcasting and gossiping in communication networks Networks 28 1996 143 156
-
(1996)
Networks
, vol.28
, pp. 143-156
-
-
Pelc, A.1
-
18
-
-
84976815497
-
Fail-stop processors: An approach to designing fault-tolerant computing systems
-
R.D. Schlichting, and F.B. Schneider Fail-stop processors: an approach to designing fault-tolerant computing systems ACM Trans. Comput. Systems 1 3 1983 222 238
-
(1983)
ACM Trans. Comput. Systems
, vol.1
, Issue.3
, pp. 222-238
-
-
Schlichting, R.D.1
Schneider, F.B.2
-
19
-
-
0012609620
-
Tolerating a linear number of faults in networks of bounded degree
-
E. Upfal Tolerating a linear number of faults in networks of bounded degree Inform. and Comput. 115 1994 312 320
-
(1994)
Inform. and Comput.
, vol.115
, pp. 312-320
-
-
Upfal, E.1
|