SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2848, Issue , 2003, Pages 224-238

Efficient gossip and robust distributed computation

(3) Georgiou, Chryssis a Kowalski, Dariusz R a,b Shvartsman, Alex A a,c

a University of Connecticut (United States)

b UNIVERSITY OF WARSAW (Poland)

c MASSACHUSETTS INSTITUTE OF TECHNOLOGY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; MESSAGE PASSING;

COMBINATORIAL PROPERTIES; COMMUNICATION GRAPHS; COMMUNICATION PRIMITIVES; DETERMINISTIC ALGORITHMS; DISTRIBUTED COMPUTATIONS; OBLIVIOUS ALGORITHMS; POINT-TO-POINT MESSAGING; RANDOM PERMUTATIONS;

ALGORITHMS;

EID: 35248829130 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/978-3-540-39989-6_16 Document Type: Article

Times cited : (11)

References (13)

1
- 0003430191
- J. Wiley and Sons, Inc., second edition
- N. Alon and J.H. Spencer. The Probabilistic Method. J. Wiley and Sons, Inc., second edition (2000)
- (2000) The Probabilistic Method
- Alon, N.¹ Spencer, J.H.²

2
- 0001757868
- Algorithms for the certified Write-All problem
- R.J. Anderson and H. Woll. Algorithms for the certified Write-All problem. SIAM Journal of Computing, Vol. 26 5 (1997) 1277-1283
- (1997) SIAM Journal of Computing , vol.26 , Issue.5 , pp. 1277-1283
- Anderson, R.J.¹ Woll, H.²

3
- 0034893155
- Performing tasks on restartable message-passing processors
- B. Chlebus, R. De Frisco and A.A. Shvartsman. Performing tasks on restartable message-passing processors. Distributed Computing, Vol. 141 (2001) 49-64
- (2001) Distributed Computing , vol.141 , pp. 49-64
- Chlebus, B.¹ De Frisco, R.² Shvartsman, A.A.³

4
- 84927949869
- Bounding work and communication in robust cooperative computation
- th International Symposium on Distributed Computing (2002) 295-310
- (2002) th International Symposium on Distributed Computing , pp. 295-310
- Chlebus, B.S.¹ Gasieniec, L.² Kowalski, D.R.³ Shvartsman, A.A.⁴

5
- 0036957216
- Gossiping to reach consensus
- th Symposium on Parallel Algorithms and Architectures (2002) 220-229
- (2002) th Symposium on Parallel Algorithms and Architectures , pp. 220-229
- Chlebus, B.S.¹ Kowalski, D.R.²

6
- 85012232388
- Time-optimal message-efficient work performance in the presence of faults
- th Symposium on Principles of Distributed Computing (1994) 161-172
- (1994) th Symposium on Principles of Distributed Computing , pp. 161-172
- De Prisco, R.¹ Mayer, A.² Yung, M.³

7
- 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 Journal on Computing, Vol. 27 5 (1998) 1457-1491
- (1998) SIAM Journal on Computing , vol.27 , Issue.5 , pp. 1457-1491
- Dwork, C.¹ Halpern, J.² Waarts, O.³

8
- 0029510897
- Resolving message complexity of byzantine agreement and beyond
- th Symp. on Foundations of Comp. Sc. (1995) 724-733
- (1995) th Symp. on Foundations of Comp. Sc. , pp. 724-733
- Galil, Z.¹ Mayer, A.² Yung, M.³

9
- 1642378346
- The complexity of synchronous iterative Do-All with crashes
- th Int-l Symposium on Distributed Computing (2001) 151-165
- (2001) th Int-l Symposium on Distributed Computing , pp. 151-165
- Georgiou, Ch.¹ Russell, A.² Shvartsman, A.A.³

10
- 35248838783
- Ch. Georgiou, D. Kowalski and A.A. Shvartsman. Efficient gossip and robust distributed computation, http://www.engr.uconn.edu/∼aas/GKS-2003.ps
- Efficient Gossip and Robust Distributed Computation
- Georgiou, Ch.¹ Kowalski, D.² Shvartsman, A.A.³

11
- 0001853771
- Efficient parallel algorithms can be made robust
- P.C. Kanellakis and A.A. Shvartsman. Efficient parallel algorithms can be made robust. Distributed Computing, Vol. 5 4 (1992) 201-217
- (1992) Distributed Computing , vol.5 , Issue.4 , pp. 201-217
- Kanellakis, P.C.¹ Shvartsman, A.A.²

12
- 23044522331
- Distributed cooperation during the absence of communication
- th Int-l Symp. on Distr. Computing (2000) 119-133
- (2000) th Int-l Symp. on Distr. Computing , pp. 119-133
- Malewicz, G.¹ Russell, A.² Shvartsman, A.A.³

13
- 0012614841
- Fault-tolerant broadcasting and gossiping in communication networks
- A. Pelc. Fault-tolerant broadcasting and gossiping in communication networks. Networks, Vol. 28 (1996) 143-156
- (1996) Networks , vol.28 , pp. 143-156
- Pelc, A.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.