@inproceedings{ben-or_completeness_1988,
	title = {Completeness {Theorems} for {Non}-{Cryptographic} {Fault}-{Tolerant} {Distributed} {Computation}},
	url = {https://www.researchgate.net/publication/221590203_Completeness_Theorems_for_Non-Cryptographic_Fault-Tolerant_Distributed_Computation_Extended_Abstract},
	doi = {10.1145/62212.62213},
	abstract = {PDF {\textbar} Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that: If no faults occur, no set of... {\textbar} Find, read and cite all the research you need on ResearchGate},
	language = {en},
	urldate = {2024-12-02},
	booktitle = {{ResearchGate}},
	author = {Ben-Or, Michael and Goldwasser, Shafi and Wigderson, Avi},
	year = {1988},
}

{"_id":"Ywn4MYyq9gGgbaBpm","bibbaseid":"benor-goldwasser-wigderson-completenesstheoremsfornoncryptographicfaulttolerantdistributedcomputation-1988","author_short":["Ben-Or, M.","Goldwasser, S.","Wigderson, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation","url":"https://www.researchgate.net/publication/221590203_Completeness_Theorems_for_Non-Cryptographic_Fault-Tolerant_Distributed_Computation_Extended_Abstract","doi":"10.1145/62212.62213","abstract":"PDF \\textbar Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that: If no faults occur, no set of... \\textbar Find, read and cite all the research you need on ResearchGate","language":"en","urldate":"2024-12-02","booktitle":"ResearchGate","author":[{"propositions":[],"lastnames":["Ben-Or"],"firstnames":["Michael"],"suffixes":[]},{"propositions":[],"lastnames":["Goldwasser"],"firstnames":["Shafi"],"suffixes":[]},{"propositions":[],"lastnames":["Wigderson"],"firstnames":["Avi"],"suffixes":[]}],"year":"1988","bibtex":"@inproceedings{ben-or_completeness_1988,\n\ttitle = {Completeness {Theorems} for {Non}-{Cryptographic} {Fault}-{Tolerant} {Distributed} {Computation}},\n\turl = {https://www.researchgate.net/publication/221590203_Completeness_Theorems_for_Non-Cryptographic_Fault-Tolerant_Distributed_Computation_Extended_Abstract},\n\tdoi = {10.1145/62212.62213},\n\tabstract = {PDF {\\textbar} Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that: If no faults occur, no set of... {\\textbar} Find, read and cite all the research you need on ResearchGate},\n\tlanguage = {en},\n\turldate = {2024-12-02},\n\tbooktitle = {{ResearchGate}},\n\tauthor = {Ben-Or, Michael and Goldwasser, Shafi and Wigderson, Avi},\n\tyear = {1988},\n}\n\n","author_short":["Ben-Or, M.","Goldwasser, S.","Wigderson, A."],"key":"ben-or_completeness_1988","id":"ben-or_completeness_1988","bibbaseid":"benor-goldwasser-wigderson-completenesstheoremsfornoncryptographicfaulttolerantdistributedcomputation-1988","role":"author","urls":{"Paper":"https://www.researchgate.net/publication/221590203_Completeness_Theorems_for_Non-Cryptographic_Fault-Tolerant_Distributed_Computation_Extended_Abstract"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"https://api.zotero.org/users/14743564/collections/U5Q7H6UA/items?key=PeWr6Jhoh9jovDsqm638nXDG&format=bibtex&limit=100","dataSources":["vgq5Ajj98MgtNSsoa"],"keywords":[],"search_terms":["completeness","theorems","non","cryptographic","fault","tolerant","distributed","computation","ben-or","goldwasser","wigderson"],"title":"Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation","year":1988}