{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T17:49:13Z","timestamp":1693676953702},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,5,1]],"date-time":"2008-05-01T00:00:00Z","timestamp":1209600000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s00493-008-2321-1","type":"journal-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T07:24:36Z","timestamp":1218612276000},"page":"261-281","source":"Crossref","is-referenced-by-count":18,"title":["A separation theorem in property testing"],"prefix":"10.1007","volume":"28","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Asaf","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,8,14]]},"reference":[{"key":"2321_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon: Testing subgraphs in large graphs, in: Proc. 42nd IEEE FOCS, IEEE (2001), pp. 434\u2013441; also: Random Structures and Algorithms 21 (2002), 359\u2013370.","DOI":"10.1109\/SFCS.2001.959918"},{"key":"2321_CR2","first-page":"656","volume-title":"Proc. of 40th FOCS","author":"N. Alon","year":"1999","unstructured":"N. Alon, E. Fischer, M. Krivelevich and M. Szegedy: Efficient testing of large graphs, in: Proc. of 40th FOCS, New York, NY, IEEE (1999), pp. 656\u2013666; also: Combinatorica 20(3) (2000), 451\u2013476."},{"key":"2321_CR3","doi-asserted-by":"crossref","unstructured":"N. Alon, E. Fischer, I. Newman and A. Shapira: A combinatorial characterization of the testable graph properties: it\u2019s all about regularity; in: Proc. of STOC 2006, pp. 251\u2013260; also: SIAM Journal on Computing, to appear.","DOI":"10.1145\/1132516.1132555"},{"key":"2321_CR4","doi-asserted-by":"crossref","unstructured":"N. Alon and A. Shapira: Every monotone graph property is testable, in: Proc. of STOC 2005, pp. 128\u2013137; also: SIAM Journal on Computing, to appear.","DOI":"10.1145\/1060590.1060611"},{"issue":"6","key":"2321_CR5","doi-asserted-by":"crossref","first-page":"1703","DOI":"10.1137\/06064888X","volume":"37","author":"N. Alon","year":"2008","unstructured":"N. Alon and A. Shapira: A characterization of the (natural) graph properties testable with one-sided error, SIAM J. on Computing 37(6) (2008), 1703\u20131727.","journal-title":"SIAM J. on Computing"},{"key":"2321_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"N. Alon and J. H. Spencer: The Probabilistic Method, Second Edition, Wiley, New York, 2000.","edition":"2"},{"key":"2321_CR7","first-page":"549","volume":"47","author":"M. Blum","year":"1993","unstructured":"M. Blum, M. Luby and R. Rubinfeld: Self-testing\/correcting with applications to numerical problems, JCSS 47 (1993), 549\u2013595.","journal-title":"JCSS"},{"key":"2321_CR8","doi-asserted-by":"crossref","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P. Erd\u0151s","year":"1959","unstructured":"P. Erd\u0151s: Graph theory and probability, Canad. J. Mathematics 11 (1959), 34\u201338.","journal-title":"Canad. J. Mathematics"},{"key":"2321_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02759942","volume":"2","author":"P. Erd\u0151s","year":"1964","unstructured":"P. Erd\u0151s: On extremal problems of graphs and generalized graphs, Israel J. Math. 2 (1964), 183\u2013190.","journal-title":"Israel J. Math."},{"key":"2321_CR10","first-page":"97","volume":"75","author":"E. Fischer","year":"2001","unstructured":"E. Fischer: The art of uninformed decisions: A primer to property testing, The Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science 75 (2001), 97\u2013126.","journal-title":"The Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science"},{"key":"2321_CR11","doi-asserted-by":"crossref","unstructured":"O. Goldreich: Combinatorial property testing \u2014 a survey, in: Randomization Methods in Algorithm Design (P. Pardalos, S. Rajasekaran and J. Rolim eds.), AMSDIMACS (1998), pp. 45\u201360.","DOI":"10.1090\/dimacs\/043\/04"},{"issue":"4","key":"2321_CR12","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"O. Goldreich, S. Goldwasser and D. Ron: Property testing and its connection to learning and approximation, JACM 45(4) (1998), 653\u2013750.","journal-title":"JACM"},{"key":"2321_CR13","doi-asserted-by":"crossref","unstructured":"O. Goldreich and D. Ron: Property Testing in Bounded-Degree Graphs, in: Proc. of STOC (1997), pp. 406\u2013415.","DOI":"10.1145\/258533.258627"},{"issue":"1","key":"2321_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/rsa.10078","volume":"23","author":"O. Goldreich","year":"2003","unstructured":"O. Goldreich and L. Trevisan: Three theorems regarding testing graph properties, Random Structures and Algorithms 23(1) (2003), 23\u201357.","journal-title":"Random Structures and Algorithms"},{"key":"2321_CR15","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1137\/S0097539703436424","volume":"33","author":"T. Kaufman","year":"2004","unstructured":"T. Kaufman, M. Krivelevich and D. Ron: Tight bounds for testing bipartiteness in general graphs, SIAM J. on Computing 33 (2004), 1441\u20131483.","journal-title":"SIAM J. on Computing"},{"key":"2321_CR16","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K\u0151v\u00e1ri","year":"1954","unstructured":"T. K\u0151v\u00e1ri, V. T. S\u00f3s and P. Tur\u00e1n: On a problem of K. Zarankiewicz, Colloquium Math. 3 (1954), 50\u201357.","journal-title":"Colloquium Math."},{"key":"2321_CR17","unstructured":"L. Lov\u00e1sz and B. Szegedy: Graph limits and testing hereditary graph properties, Technical Report MSR-TR-2005-110, Microsoft Research."},{"issue":"3","key":"2321_CR18","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips and P. Sarnak: Ramanujan graphs, Combinatorica 8(3) (1988), 261\u2013277.","journal-title":"Combinatorica"},{"key":"2321_CR19","unstructured":"C. Papadimitriou: Computational Complexity, Addison Wesley, 1994."},{"key":"2321_CR20","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/rsa.10013","volume":"20","author":"M. Parnas","year":"2002","unstructured":"M. Parnas and D. Ron: Testing the diameter of graphs, Random structures and algorithms 20 (2002), 165\u2013183.","journal-title":"Random structures and algorithms"},{"key":"2321_CR21","doi-asserted-by":"crossref","unstructured":"D. Ron: Property testing, in: P. M. Pardalos, S. Rajasekaran, J. Reif and J. D. P. Rolim, editors, Handbook of Randomized Computing, Vol. II, Kluwer Academic Publishers, 2001, pp. 597\u2013649.","DOI":"10.1007\/978-1-4615-0013-1_15"},{"key":"2321_CR22","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"R. Rubinfeld and M. Sudan: Robust characterization of polynomials with applications to program testing, SIAM J. on Computing 25 (1996), 252\u2013271.","journal-title":"SIAM J. on Computing"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2321-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-008-2321-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2321-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T15:17:36Z","timestamp":1684509456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-008-2321-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["2321"],"URL":"https:\/\/doi.org\/10.1007\/s00493-008-2321-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5]]}}}