Fault tolerance in networks of bounded degree

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fault tolerance in networks of bounded degree

Full text

Pdf (750 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the eighteenth annual ACM symposium on Theory of computing table of contents

Berkeley, California, United States

Pages: 370 - 379

Year of Publication: 1986

ISBN:0-89791-193-8

Authors

C Dwork	IBM Almaden Research Center, San-Jose, California
D Peleg	IBM Almaden Research Center, San-Jose, California
N Pippenger	IBM Almaden Research Center, San-Jose, California
E Upfal	IBM Almaden Research Center, San-Jose, California

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 28, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/12130.12169 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	B	Bollob&s B., "Random Graphs" Combinatorics, London Math. Soc. Lect. Notes, 52, Cambridge University Press, pp. 80- 102 (1981)
	D	Dolev D., "The Byzantine generals strike again", J. of Algorithms, Vol. 3, No. 1 (1982), pp 14-30.
	DFFLS	Dolev D., Fischer M.J., Fowler R., Lynch N.A., Strong R. "An Efficient Algorithm for Byzantine Agreement Without Authentication", Information and Control 52(3), pp.256-274 (1982).
	F	Fischer M.J., "The consensus problem in unreliable distributed systems", Technical Report 273, Dept. of Computer Science, Yale University, 1983.
	GG	Gabber O., and Galil Z., "Explicit construction of linear-sized Superconcentrators" J. Comp. and Syst. Sci. Vol. 22 (1981), pp 407- 420.
	H	Vassos Hadzilacos, Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing), 1985
	LPS	A Lubotzky , R Phillips , P Sarnak, Explicit expanders and the Ramanujan conjectures, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.240-246, May 28-30, 1986, Berkeley, California, United States [doi>10.1145/12130.12154]
	PSL	M. Pease , R. Shostak , L. Lamport, Reaching Agreement in the Presence of Faults, Journal of the ACM (JACM), v.27 n.2, p.228-234, April 1980 [doi>10.1145/322186.322188]
	P	Pippenger N., "On network of noisy gates", 26th Annual Symposium on Foundation of Computer Science, 1985, pp. 31-38.
	U	Jeffrey D Ullma, Computational Aspects of VLSI, W. H. Freeman & Co., New York, NY, 1984

CITED BY 4

	P. C. Kanellakis , A. A. Shvartsman, Efficient parallel algorithms can be made robust, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.211-219, June 1989, Edmonton, Alberta, Canada
	Paris C. Kanellakis , Alex A. Shvartsman, Efficient parallel algorithms on restartable fail-stop processors, Proceedings of the tenth annual ACM symposium on Principles of distributed computing, p.23-36, August 19-21, 1991, Montreal, Quebec, Canada
	Z. M. Kedem , K. V. Palem , P. G. Spirakis, Efficient robust parallel computations, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.138-148, May 13-17, 1990, Baltimore, Maryland, United States
	Paris C. Kanellakis , Alex A. Shvartsman, Efficient parallel algorithms can be made robust, Distributed Computing, v.5 n.4, p.201-217, April 1992