{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:04:48Z","timestamp":1787504688355,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540323013","type":"print"},{"value":"9783540322887","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_44","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"537-548","source":"Crossref","is-referenced-by-count":7,"title":["Reliable Computations Based on Locally Decodable Codes"],"prefix":"10.1007","author":[{"given":"Andrei","family":"Romashchenko","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"44_CR1","volume-title":"Automata Studies","author":"J. Neuman von","year":"1956","unstructured":"von Neuman, J.: Probabilistic logics and the synthesis of reliable organisms from unreliable components. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, Princeton University Press, Princeton (1956)"},{"key":"44_CR2","first-page":"254","volume":"3","author":"A.V. Kuznetsov","year":"1973","unstructured":"Kuznetsov, A.V.: Information storage in a memory assembled from unreliable components. Problems of Information Transmission\u00a03, 254\u2013264 (1973)","journal-title":"Problems of Information Transmission"},{"issue":"1","key":"44_CR3","first-page":"203","volume":"13","author":"R.L. Dobrushin","year":"1977","unstructured":"Dobrushin, R.L., Ortyukov, S.L.: Upper bound for the redundancy of self-correcting arrangement of unreliable functional elements. Problems for Information Transmission\u00a013(1), 203\u2013218 (1977)","journal-title":"Problems for Information Transmission"},{"issue":"1","key":"44_CR4","first-page":"201","volume":"13","author":"R.L. Dobrushin","year":"1977","unstructured":"Dobrushin, R.L., Ortyukov, S.L.: Lower bound on the redundancy of self-correcting arrangement of unreliable functional elements. Problems for Information Transmission\u00a013(1), 201\u2013208 (1977)","journal-title":"Problems for Information Transmission"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Pippenger, N.: On Networks of Noisy gates. In: Proc. of the 26-th IEEE FOCS Symposium, pp. 30\u201338 (1985)","DOI":"10.1109\/SFCS.1985.41"},{"issue":"3","key":"44_CR6","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1109\/18.79921","volume":"37","author":"N. Pippenger","year":"1991","unstructured":"Pippenger, N., Stamoulis, G.D., Tsitsikilis, J.N.: On a lower bound on for the redundancy of reliable networks with noisy gates. IEEE Trans. Inform. Theory\u00a037(3), 639\u2013643 (1991)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Reischuk, R., Schmeltz, B.: Reliable computation with noisy circuits and decision trees \u2013 a general nlogn lower bound. In: Proc. of the 32-th IEEE FOCS Symposium, pp. 602\u2013611 (1991)","DOI":"10.1109\/SFCS.1991.185425"},{"key":"44_CR8","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1109\/18.312190","volume":"40","author":"P. G\u00e1cs","year":"1994","unstructured":"G\u00e1cs, P., G\u00e1l, A.: Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates. IEEE Transactions Information Theory\u00a040, 579\u2013583 (1994)","journal-title":"IEEE Transactions Information Theory"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"G\u00e1l, A., Szegedy, M.: Fault Tolerant Circuits and Probabilistically Checkable proofs. In: Proc. of 10th Annual Structure in Complexity Theory Conference, pp. 65\u201373 (1995)","DOI":"10.1109\/SCT.1995.514728"},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Spielman, D.A.: Highly fault-Tolerant parallel Computation. In: Proc. of the 37-th IEEE FOCS Symposium, pp. 154\u2013163 (1996)","DOI":"10.1109\/SFCS.1996.548474"},{"issue":"4","key":"44_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<315::AID-RSA3>3.0.CO;2-1","volume":"11","author":"A. Goldreich","year":"1997","unstructured":"Goldreich, A., Wigderson, A.: Tiny Families of Functions with Random Properties: a Quality-Size Trade-off for Hashing. Random Struct. Algorithms\u00a011(4), 315\u2013343 (1997)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"44_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.2307\/3062153","volume":"155","author":"O. Reingold","year":"2002","unstructured":"Reingold, O., Vadhan, S., Wigderson, A.: Entropy waves, the zig-zag product, and new constant degree expanders. Annals of Mathematics\u00a0155(1), 157\u2013187 (2002)","journal-title":"Annals of Mathematics"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Karloff, H.J., Schulman, L.J., Trevisan, L.: Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. IEEE Conference on Computational Complexity, 175\u2013183 (2002)","DOI":"10.1109\/CCC.2002.1004353"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T16:55:14Z","timestamp":1736268914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11672142_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}