{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T17:10:29Z","timestamp":1740244229158,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_53","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"629-640","source":"Crossref","is-referenced-by-count":5,"title":["Data Stream Algorithms for Codeword Testing"],"prefix":"10.1007","author":[{"given":"Atri","family":"Rudra","sequence":"first","affiliation":[]},{"given":"Steve","family":"Uurtamo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"53_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"53_CR2","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. J. ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"key":"53_CR3","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Blais, E., Demirbas, M., O\u2019Donnell, R., Rudra, A., Uurtamo, S.: k+ decision trees (2010) (manuscript)","DOI":"10.1007\/978-3-642-16988-5_7"},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rompel, J.: Randomness-efficient oblivious sampling. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), pp. 276\u2013287 (1994)","DOI":"10.1109\/SFCS.1994.365687"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Guruswami, V., Kaufman, T., Sudan, M., Viderman, M.: Locally testable codes require redundant testers. In: IEEE Conference on Computational Complexity, pp. 52\u201361 (2009)","DOI":"10.1109\/CCC.2009.6"},{"issue":"1","key":"53_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539704445445","volume":"35","author":"E. Ben-Sasson","year":"2005","unstructured":"Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: Some 3cnf properties are hard to test. SIAM J. Comput.\u00a035(1), 1\u201321 (2005)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"53_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1147\/rd.282.0124","volume":"28","author":"C.L. Chen","year":"1984","unstructured":"Chen, C.L., Hsiao, M.Y.: Error-correcting codes for semiconductor memory applications: A state-of-the-art review. IBM Journal of Research and Development\u00a028(2), 124\u2013134 (1984)","journal-title":"IBM Journal of Research and Development"},{"issue":"2","key":"53_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/176979.176981","volume":"26","author":"P.M. Chen","year":"1994","unstructured":"Chen, P.M., Lee, E.K., Gibson, G.A., Katz, R.H., Patterson, D.A.: RAID: High-performance, reliable secondary storage. ACM Computing Surveys\u00a026(2), 145\u2013185 (1994)","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"53_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1236457.1236459","volume":"54","author":"I. Dinur","year":"2007","unstructured":"Dinur, I.: The PCP theorem by gap amplification. J. ACM\u00a054(3), 12 (2007)","journal-title":"J. ACM"},{"key":"53_CR10","volume-title":"Combinatorial Group Testing and its Applications","author":"D.-Z. Du","year":"2000","unstructured":"Du, D.-Z., Hwang, F.K.: Combinatorial Group Testing and its Applications. World Scientific, Singapore (2000)"},{"issue":"6","key":"53_CR11","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/1516046.1516059","volume":"52","author":"J. Elerath","year":"2009","unstructured":"Elerath, J.: Hard-disk drives: The good, the bad, and the ugly. Communications of the ACM\u00a052(6), 38\u201345 (2009)","journal-title":"Communications of the ACM"},{"issue":"1","key":"53_CR12","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/jcta.1996.0012","volume":"73","author":"Z. F\u00fcredi","year":"1996","unstructured":"F\u00fcredi, Z.: On r-cover-free families. J. Comb. Theory, Ser. A\u00a073(1), 172\u2013173 (1996)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"53_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/11538462_26","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"V. Guruswami","year":"2005","unstructured":"Guruswami, V., Rudra, A.: Tolerant locally testable codes. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 306\u2013317. Springer, Heidelberg (2005)"},{"issue":"1","key":"53_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TIT.2007.911222","volume":"54","author":"V. Guruswami","year":"2008","unstructured":"Guruswami, V., Rudra, A.: Explicit codes achieving list decoding capacity: Error-correction up to the Singleton bound. IEEE Transactions on Information Theory\u00a054(1), 135\u2013150 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"key":"53_CR15","doi-asserted-by":"crossref","unstructured":"Indyk, P., Ngo, H.Q., Rudra, A.: Efficiently decodable non-adaptive group testing. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1126\u20131142 (2010)","DOI":"10.1137\/1.9781611973075.91"},{"key":"53_CR16","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"53_CR17","doi-asserted-by":"crossref","unstructured":"Rudra, A., Uurtamo, S.: Data stream algorithms for codeword testing. arXiv:1004.4601 [cs.IT] (2010)","DOI":"10.1007\/978-3-642-14165-2_53"},{"key":"53_CR18","doi-asserted-by":"crossref","unstructured":"Rudra, A., Uurtamo, S.: Two theorems in list decoding. ECCC Technical Report TR10-007 (2010)","DOI":"10.1007\/978-3-642-15369-3_52"},{"issue":"6","key":"53_CR19","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"D. Spielman","year":"1996","unstructured":"Spielman, D.: Linear-time encodable and decodable error-correcting codes. IEEE Transactions on Information Theory\u00a042(6), 1723\u20131732 (1996)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T16:31:19Z","timestamp":1740241879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_53"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}