{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:06:57Z","timestamp":1648692417984},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,7,30]],"date-time":"2013-07-30T00:00:00Z","timestamp":1375142400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s00453-013-9817-9","type":"journal-article","created":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T10:58:53Z","timestamp":1375095533000},"page":"496-516","source":"Crossref","is-referenced-by-count":0,"title":["Local Correction with Constant Error Rate"],"prefix":"10.1007","volume":"71","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Weinstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,30]]},"reference":[{"key":"9817_CR1","first-page":"394","volume-title":"Proc. RANDOM-APPROX","author":"N. Alon","year":"2010","unstructured":"Alon, N., Blais, E.: Testing boolean function isomorphism. In: Proc. RANDOM-APPROX, pp. 394\u2013405 (2010)"},{"issue":"2","key":"9817_CR2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/110832677","volume":"42","author":"N. Alon","year":"2013","unstructured":"Alon, N., Blais, E., Chakraborty, S., Garc\u00eda-Soriano, D., Matsliah, A.: Nearly tight bounds for testing function isomorphism. SIAM J. Comput. 42(2), 459\u2013493 (2013)","journal-title":"SIAM J. Comput."},{"key":"9817_CR3","series-title":"IEEE Transactions on Information Theory","first-page":"188","volume-title":"Proc. RANDOM-APPROX","author":"N. Alon","year":"2003","unstructured":"Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing low-degree polynomials over GF(2). In: Proc. RANDOM-APPROX. IEEE Transactions on Information Theory, vol. 51, pp. 188\u2013199 (2003). Also: Testing Reed-Muller codes, pp.\u00a04032\u20134039 (2005)"},{"key":"9817_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2008","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 3rd edn. Wiley, New York (2008)","edition":"3"},{"issue":"6","key":"9817_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.ipl.2011.12.005","volume":"112","author":"N. Alon","year":"2012","unstructured":"Alon, N., Weinstein, A.: Local correction of juntas. Inf. Process. Lett. 112(6), 223\u2013226 (2012)","journal-title":"Inf. Process. Lett."},{"key":"9817_CR6","doi-asserted-by":"crossref","first-page":"357","DOI":"10.2748\/tmj\/1178243286","volume":"19","author":"K. Azuma","year":"1967","unstructured":"Azuma, K.: Weighted sums of certain dependent random variables. Tokohu Math. J. 19, 357\u2013367 (1967)","journal-title":"Tokohu Math. J."},{"key":"9817_CR7","first-page":"317","volume-title":"Proc. 12th Workshop RANDOM","author":"E. Blais","year":"2008","unstructured":"Blais, E.: Improved bounds for testing juntas. In: Proc. 12th Workshop RANDOM, pp. 317\u2013330 (2008)"},{"key":"9817_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/1536414.1536437","volume-title":"Proc. 41st Annual ACM Symposium on Theory of Computing (STOC)","author":"E. Blais","year":"2009","unstructured":"Blais, E.: Testing juntas nearly optimally. In: Proc. 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 151\u2013158 (2009)"},{"key":"9817_CR9","first-page":"235","volume-title":"IEEE Conference on Computational Complexity","author":"E. Blais","year":"2010","unstructured":"Blais, E., O\u2019Donnell, R.: Lower bounds for testing function isomorphism. In: IEEE Conference on Computational Complexity, pp. 235\u2013246 (2010)"},{"key":"9817_CR10","first-page":"551","volume-title":"Proc. 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"E. Blais","year":"2012","unstructured":"Blais, E., Weinstein, A., Yoshida, Y.: Partially symmetric functions are efficiently isomorphism-testable. In: Proc. 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0551\u2013560 (2012)"},{"issue":"6","key":"9817_CR11","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.ipl.2004.01.023","volume":"90","author":"H. Chockler","year":"2004","unstructured":"Chockler, H., Gutfreund, D.: A lower bound for testing juntas. Inf. Process. Lett. 90(6), 301\u2013305 (2004)","journal-title":"Inf. Process. Lett."},{"key":"9817_CR12","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1137\/1.9781611973082.130","volume-title":"Proc. 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"S. Chakraborty","year":"2011","unstructured":"Chakraborty, S., Garc\u00eda-Soriano, D., Matsliah, A.: Nearly tight bounds for testing function isomorphism. In: Proc. 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1683\u20131702 (2011)"},{"key":"9817_CR13","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1109\/FOCS.2007.32","volume-title":"Proc. 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"I. Diakonikolas","year":"2007","unstructured":"Diakonikolas, I., Lee, H., Matulef, K., Onak, K., Rubinfeld, R., Servedio, R., Wan, A.: Testing for concise representations. In: Proc. 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 549\u2013558 (2007)"},{"issue":"4","key":"9817_CR14","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1016\/j.jcss.2003.11.004","volume":"68","author":"E. Fischer","year":"2004","unstructured":"Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing juntas. J. Comput. Syst. Sci. 68(4), 753\u2013787 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"9817_CR15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"9817_CR16","first-page":"433","volume-title":"Proc. 52rd Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"M. Jha","year":"2011","unstructured":"Jha, M., Raskhodnikova, S.: Testing and reconstruction of Lipschitz functions with applications to data privacy. In: Proc. 52rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 433\u2013443 (2011)"},{"key":"9817_CR17","doi-asserted-by":"crossref","unstructured":"Servedio, R.A.: Testing by implicit learning: a brief survey. Property Testing pp. 197\u2013210 (2010)","DOI":"10.1007\/978-3-642-16367-8_11"},{"key":"9817_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14358-8","volume-title":"Locally Decodable Codes","author":"S. Yekhanin","year":"2010","unstructured":"Yekhanin, S.: Locally Decodable Codes. Now Publishers, Hanover (2010)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9817-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9817-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9817-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T18:09:08Z","timestamp":1563559748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9817-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,30]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9817"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9817-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,30]]}}}