{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:45:28Z","timestamp":1764557128318,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,5,22]]},"DOI":"10.1145\/1060590.1060611","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T04:31:47Z","timestamp":1123043507000},"page":"128-137","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Every monotone graph property is testable"],"prefix":"10.1145","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Isarel"}]},{"given":"Asaf","family":"Shapira","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Isarel"}]}],"member":"320","published-online":{"date-parts":[[2005,5,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875540"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1005"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796495"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700366528"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199358655"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00019-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780644"},{"key":"e_1_3_2_1_8_1","unstructured":"N. Alon and A. Shapira Extremal graphs recursive functions and a separation theorem in property-testing manuscript.  N. Alon and A. Shapira Extremal graphs recursive functions and a separation theorem in property-testing manuscript."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"Alon N.","year":"2000","unstructured":"N. Alon and J. H. Spencer , The probabilistic method , Second Edition, Wiley , New York , 2000 . N. Alon and J. H. Spencer, The probabilistic method, Second Edition, Wiley, New York, 2000."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00175-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070016"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788085"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01195000"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. of the 12th SODA","author":"Fischer E.","year":"2001","unstructured":"E. Fischer , Testing graphs for colorability properties , Proc. of the 12th SODA ( 2001 ), 873--882. E. Fischer, Testing graphs for colorability properties, Proc. of the 12th SODA (2001), 873--882."},{"key":"e_1_3_2_1_15_1","first-page":"97","article-title":"The art of uninformed decisions: A primer to property testing","volume":"75","author":"Fischer E.","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 -- 126 . 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--126.","journal-title":"The Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10110"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-96-03732-X"},{"key":"e_1_3_2_1_18_1","volume-title":"Combinatorial property testing - a survey","author":"Goldreich O.","year":"1998","unstructured":"O. Goldreich , Combinatorial property testing - a survey , In : Randomization Methods in Algorithm Design (P. Pardalos, S. Rajasekaran and J. Rolim eds.), AMS-DIMACS ( 1998 ), 45--60. O. Goldreich, Combinatorial property testing - a survey, In: Randomization Methods in Algorithm Design (P. Pardalos, S. Rajasekaran and J. Rolim eds.), AMS-DIMACS (1998), 45--60."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10078"},{"key":"e_1_3_2_1_21_1","volume-title":"Ramsey Theory","author":"Graham R. L.","year":"1990","unstructured":"R. L. Graham , B. L. Rothschild and J. H. Spencer , Ramsey Theory , Second Edition, Wiley , New York , 1990 . R. L. Graham, B. L. Rothschild and J. H. Spencer, Ramsey Theory, Second Edition, Wiley, New York, 1990."},{"key":"e_1_3_2_1_22_1","unstructured":"W. T. Gowers Hypergraph regularity and the multidimensional Szemer\u00e9di theorem manuscript.  W. T. Gowers Hypergraph regularity and the multidimensional Szemer\u00e9di theorem manuscript."},{"key":"e_1_3_2_1_23_1","volume-title":"Combinatorics, Paul Erd\u00f6s is Eighty, Vol II","author":"Koml\u00f3s J.","year":"1996","unstructured":"J. Koml\u00f3s and M. Simonovits , Szemer\u00e9di's Regularity Lemma and its applications in graph theory . In: Combinatorics, Paul Erd\u00f6s is Eighty, Vol II (D. Mikl\u00f3s, V. T. S\u00f6s, T. Sz\u00f6nyi eds.), J\u00e1nos Bolyai Math. Soc., Budapest ( 1996 ), 295--352. J. Koml\u00f3s and M. Simonovits, Szemer\u00e9di's Regularity Lemma and its applications in graph theory. In: Combinatorics, Paul Erd\u00f6s is Eighty, Vol II (D. Mikl\u00f3s, V. T. S\u00f6s, T. Sz\u00f6nyi eds.), J\u00e1nos Bolyai Math. Soc., Budapest (1996), 295--352."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796549"},{"key":"e_1_3_2_1_25_1","unstructured":"B. Nagle V. R\u00f6dl and M. Schacht The counting lemma for regular k-uniform hypegraphs manuscript.  B. Nagle V. R\u00f6dl and M. Schacht The counting lemma for regular k-uniform hypegraphs manuscript."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02582932"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20017"},{"volume-title":"Handbook of Randomized Computing","year":"2001","key":"e_1_3_2_1_28_1","unstructured":"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 , 597--649. 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, 597--649."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255151"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds.","author":"Szemer\u00e9di E.","year":"1978","unstructured":"E. Szemer\u00e9di , Regular partitions of graphs , In: Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds. , 1978 , 399--401. E. Szemer\u00e9di, Regular partitions of graphs, In: Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds., 1978, 399--401."}],"event":{"name":"STOC05: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Baltimore MD USA","acronym":"STOC05"},"container-title":["Proceedings of the thirty-seventh annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1060590.1060611","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T03:26:33Z","timestamp":1673148393000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060590.1060611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,22]]},"references-count":30,"alternative-id":["10.1145\/1060590.1060611","10.1145\/1060590"],"URL":"https:\/\/doi.org\/10.1145\/1060590.1060611","relation":{},"subject":[],"published":{"date-parts":[[2005,5,22]]},"assertion":[{"value":"2005-05-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}