Journal of the ACM Bibliography
Nicholas Pippenger.
Invariance of complexity measures for networks with unreliable gates.
Journal of the ACM, 36(3):531-539, July 1989.
[BibTeX entry]
Selected papers that cite this one
- Dan Kleitman, Tom Leighton, and Yuan Ma. On the design of
reliable Boolean circuits that contain partially unreliabel gates.
Journal of Computer and System Sciences, 55(3):385-401,
December 1997.
- Sridhar Rajagopalan and Leonard Schulman. A coding theorem for
distributed computation. In Proceedings of the Twenty-Sixth
Annual ACM Symposium on the Theory of Computing, pages 790-799,
Montréal, Québec, Canada, 23-25 May 1994.
- Peter W. Shor. Fault-tolerant quantum
computation. In 37th Annual Symposium on Foundations of
Computer Science, pages 56-65, Burlington, Vermont, 14-16 October
1996. IEEE.
- Daniel A. Spielman. Highly fault-tolerant
parallel computation (extended abstract). In 37th Annual
Symposium on Foundations of Computer Science, pages 154-163,
Burlington, Vermont, 14-16 October 1996. IEEE.
Shortcuts: