Agreement in the presence of faults, on networks of bounded degree

Information Processing Letters

Volumn 57, Issue 6, 1996, Pages 329-334

  Ben Or, Michael ^a   Ron, Dana ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Agreement; Distributes computing; Fault tolerance

Indexed keywords

EID: 0042541219     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00015-4     Document Type: Article

References (8)

1. P. Berman and J.A. Garay, Asymptotically optimal distributed consensus, in: Proc. 16th ICALP (1989) 80-94.
2. P. Berman and J.A. Garay, Fast consensus in networks of bounded degree, in: Proc. 4th Internat. Workshop on Distributed Algorithms (1990) 321-333.
3. D. Dolev, The Byzantine generals strike again, J. Algorithms 3 (1982) 14-30.
4. C. Dwork, D. Peleg, N. Pippenger and E. Upfal, Fault tolerance in networks of bounded degree, in: Proc. 18th Ann. Symp. on Theory of Computing (1986) 370-379.
5. A. Lubotzky, R. Phillips and P. Sarnak, Ramanugan conjecture and explicit construction of expanders, in: Proc. 18th Ann. Symp. on Theory of Computing (1986) 240-246.
6. N. Pippenger, On network of noisy gates, in: Proc. 26th Ann. Symp. on Foundation of Computer Science (1985) 30-38.
7. P. Raghaven, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, in: Proc. 27th Ann. Symp. on Foundation of Computer Science (1986) 10-18.
8. E. Upfal, Tolerating linear number of faults in networks of bounded degree, in: Proc. 10th Ann. Symp. on Principles of Distributed Computing (1992), to appear.