{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:05:34Z","timestamp":1764133534742,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3520007","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"582-594","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Circuits resilient to short-circuit errors"],"prefix":"10.1145","author":[{"given":"Klim","family":"Efremenko","sequence":"first","affiliation":[{"name":"Ben-Gurion University of the Negev, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Haeupler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland \/ Carnegie Mellon University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yael Tauman","family":"Kalai","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA \/ Massachusetts Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pritish","family":"Kamath","sequence":"additional","affiliation":[{"name":"Google Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gillat","family":"Kol","sequence":"additional","affiliation":[{"name":"Princeton University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Resch","sequence":"additional","affiliation":[{"name":"CWI, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghuvansh R.","family":"Saxena","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90093-0"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275569"},{"key":"e_1_3_2_1_3_1","volume-title":"Optimal Short-Circuit Resilient Formulas. In Computational Complexity Conference (CCC)","volume":"137","author":"Braverman Mark","unstructured":"Mark Braverman , Klim Efremenko , Ran Gelles , and Michael A. Yitayew . 2019 . Optimal Short-Circuit Resilient Formulas. In Computational Complexity Conference (CCC) , Vol. 137 . 10: 1-10 : 22. Mark Braverman, Klim Efremenko, Ran Gelles, and Michael A. Yitayew. 2019. Optimal Short-Circuit Resilient Formulas. In Computational Complexity Conference (CCC), Vol. 137. 10: 1-10 : 22."},{"key":"e_1_3_2_1_4_1","volume-title":"Symposium on Discrete Algorithms (SODA). 2349-2365","author":"Hubert Chan T.-H.","year":"2020","unstructured":"T.-H. Hubert Chan , Zhibin Liang , Antigoni Polychroniadou , and Elaine Shi . 2020 . Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels . In Symposium on Discrete Algorithms (SODA). 2349-2365 . T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, and Elaine Shi. 2020. Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. In Symposium on Discrete Algorithms (SODA). 2349-2365."},{"key":"e_1_3_2_1_5_1","unstructured":"Roland L'vovich Dobrushin and SI Ortyukov. 1977. Upper bound on the redundancy of self-correcting arrangements of unreliable functional elements. Problemy Peredachi Informatsii 13 3 ( 1977 ) 56-76.   Roland L'vovich Dobrushin and SI Ortyukov. 1977. Upper bound on the redundancy of self-correcting arrangements of unreliable functional elements. Problemy Peredachi Informatsii 13 3 ( 1977 ) 56-76."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.669417"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.796377"},{"key":"e_1_3_2_1_8_1","volume-title":"Schulman","author":"Evans William S.","year":"2003","unstructured":"William S. Evans and Leonard J . Schulman . 2003 . On the maximum tolerable noise of k-input gates for reliable computation by formulas. IEEE Transactions on Information Theory 49 ( 2003 ), 3094-3098. William S. Evans and Leonard J. Schulman. 2003. On the maximum tolerable noise of k-input gates for reliable computation by formulas. IEEE Transactions on Information Theory 49 ( 2003 ), 3094-3098."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.30978"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.312190"},{"key":"e_1_3_2_1_11_1","first-page":"594","article-title":"Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates","author":"G\u00e1l Anna","year":"1991","unstructured":"Anna G\u00e1l . 1991 . Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates . In Foundations of Computer Science (FOCS). 594 - 601 . Anna G\u00e1l. 1991. Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates. In Foundations of Computer Science (FOCS). 594-601.","journal-title":"Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1995.514728"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188838"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000079"},{"key":"e_1_3_2_1_15_1","volume-title":"Coding for Interactive Communication with Small Memory and Applications to Robust Circuits. arXiv abs\/","author":"Haeupler Bernhard","year":"1805","unstructured":"Bernhard Haeupler and Nicolas Resch . 2018. Coding for Interactive Communication with Small Memory and Applications to Robust Circuits. arXiv abs\/ 1805 .06872v1 ( 2018 ). arXiv: 1805.06872v1 Bernhard Haeupler and Nicolas Resch. 2018. Coding for Interactive Communication with Small Memory and Applications to Robust Circuits. arXiv abs\/ 1805.06872v1 ( 2018 ). arXiv: 1805.06872v1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.75261"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Pavel Hrube\u0161 and Pavel Pudl\u00e1k. 2018. A note on monotone real circuits. Inform. Process. Lett. 131 ( 2018 ) 15-19.   Pavel Hrube\u0161 and Pavel Pudl\u00e1k. 2018. A note on monotone real circuits. Inform. Process. Lett. 131 ( 2018 ) 15-19.","DOI":"10.1016\/j.ipl.2017.11.002"},{"key":"e_1_3_2_1_18_1","first-page":"490","article-title":"Formulas Resilient to Short-Circuit Errors","author":"Kalai Yael Tauman","year":"2012","unstructured":"Yael Tauman Kalai , Allison B. Lewko , and Anup Rao . 2012 . Formulas Resilient to Short-Circuit Errors . In Foundations of Computer Science (FOCS). 490 - 499 . Yael Tauman Kalai, Allison B. Lewko, and Anup Rao. 2012. Formulas Resilient to Short-Circuit Errors. In Foundations of Computer Science (FOCS). 490-499.","journal-title":"Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62265"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1531"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275541"},{"key":"e_1_3_2_1_22_1","first-page":"30","article-title":"On networks of noisy gates","author":"Pippenger Nicholas","year":"1985","unstructured":"Nicholas Pippenger . 1985 . On networks of noisy gates . In Foundations of Computer Science (FOCS). 30 - 38 . Nicholas Pippenger. 1985. On networks of noisy gates. In Foundations of Computer Science (FOCS). 30-38.","journal-title":"Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.2628"},{"key":"e_1_3_2_1_24_1","first-page":"30","volume-title":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS","volume":"8","author":"Pudl\u00e1k Pavel","year":"2010","unstructured":"Pavel Pudl\u00e1k . 2010 . On extracting computations from propositional proofs (a survey) . In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), Vol. 8 . 30 - 41 . Pavel Pudl\u00e1k. 2010. On extracting computations from propositional proofs (a survey). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), Vol. 8. 30-41."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Alexander Razborov. 1995. Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic. Izvestiya of the RAN ( 1995 ) 201-224. Issue 1.   Alexander Razborov. 1995. Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic. Izvestiya of the RAN ( 1995 ) 201-224. Issue 1.","DOI":"10.1070\/IM1995v059n01ABEH000009"},{"key":"e_1_3_2_1_26_1","first-page":"724","article-title":"Communication on noisy channels: A coding theorem for computation. In Foundations of Computer Science (FOCS)","author":"Schulman Leonard J","year":"1992","unstructured":"Leonard J Schulman . 1992 . Communication on noisy channels: A coding theorem for computation. In Foundations of Computer Science (FOCS) . IEEE , 724 - 733 . Leonard J Schulman. 1992. Communication on noisy channels: A coding theorem for computation. In Foundations of Computer Science (FOCS). IEEE, 724-733.","journal-title":"IEEE"},{"key":"e_1_3_2_1_27_1","volume-title":"Deterministic Coding for Interactive Communication. In Symposium on Theory of Computing (STOC). 747-756","author":"Schulman Leonard J.","year":"1993","unstructured":"Leonard J. Schulman . 1993 . Deterministic Coding for Interactive Communication. In Symposium on Theory of Computing (STOC). 747-756 . Leonard J. Schulman. 1993. Deterministic Coding for Interactive Communication. In Symposium on Theory of Computing (STOC). 747-756."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556671"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58747-9_26"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"John Von Neumann. 1956. Probabilistic logics and the synthesis of reliable organisms from unreliable components. Automata Studies ( 1956 ) 43-98.   John Von Neumann. 1956. Probabilistic logics and the synthesis of reliable organisms from unreliable components. Automata Studies ( 1956 ) 43-98.","DOI":"10.1515\/9781400882618-003"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rome Italy","acronym":"STOC '22"},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520007","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3520007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:39Z","timestamp":1750268979000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":30,"alternative-id":["10.1145\/3519935.3520007","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3520007","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}