Completeness theorems for non-cryptographic fault-tolerant distributed computation

Michael Ben-Or; Shafi Goldwasser; Avi Wigderson

Conference ProceedingsOPEN ACCESS

Completeness theorems for non-cryptographic fault-tolerant distributed computation

Ben-Or M
Goldwasser S
Wigderson A

Proceedings of the Annual ACM Symposium on Theory of Computing (1988) 1-10

DOI: 10.1145/62212.62213

2.0kCitations

286Readers

Abstract

Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that: 1. If no faults occur, no set of size t

Cite

CITATION STYLE

APA

Ben-Or, M., Goldwasser, S., & Wigderson, A. (1988). Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 1–10). Association for Computing Machinery. https://doi.org/10.1145/62212.62213

Completeness theorems for non-cryptographic fault-tolerant distributed computation

Abstract

Cite

Register to see more suggestions