{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T18:39:27Z","timestamp":1793126367711,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":15,"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.1060612","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T04:31:47Z","timestamp":1123043507000},"page":"138-146","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Testing versus estimation of graph properties"],"prefix":"10.1145","author":[{"given":"Eldar","family":"Fischer","sequence":"first","affiliation":[{"name":"Technion -- Israel institute of technology, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ilan","family":"Newman","sequence":"additional","affiliation":[{"name":"Haifa University, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,5,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1005"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070001"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060611"},{"key":"e_1_3_2_1_4_1","unstructured":"N. Alon and A. Shapira private communication.  N. Alon and A. Shapira private communication."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90044-W"},{"key":"e_1_3_2_1_6_1","volume-title":"Graph Theory","author":"Diestel R.","year":"2000","unstructured":"R. Diestel , Graph Theory ( 2 nd edition), Springer ( 2000 ). R. Diestel, Graph Theory (2nd edition), Springer (2000).","edition":"2"},{"key":"e_1_3_2_1_7_1","volume-title":"12th SODA","author":"Fischer E.","year":"2001","unstructured":"E. Fischer , Testing graphs for colorability properties, Random Structures and Algorithms, to appear (a preliminary version appeared in Proc . 12th SODA , 2001 ). E. Fischer, Testing graphs for colorability properties, Random Structures and Algorithms, to appear (a preliminary version appeared in Proc. 12th SODA, 2001)."},{"key":"e_1_3_2_1_8_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 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 Bulletin of the European Association for Theoretical Computer Science 75 (2001), 97--126.","journal-title":"The Bulletin of the European Association for Theoretical Computer Science"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970445603"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.30"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10078"},{"key":"e_1_3_2_1_14_1","volume-title":"Property testing (a tutorial)","author":"Ron D.","year":"2001","unstructured":"D. Ron , Property testing (a tutorial) , In : Handbook of Randomized Computing (S. Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolim eds), Kluwer Press ( 2001 ). D. Ron, Property testing (a tutorial), In: Handbook of Randomized Computing (S. Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolim eds), Kluwer Press (2001)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255151"},{"key":"e_1_3_2_1_16_1","volume-title":"Regular partitions of graphs","author":"Szemer\u00e9di E.","unstructured":"E. Szemer\u00e9di , Regular partitions of graphs , In : Proc. Colloque Inter. CNRS No. 260 (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau eds.), 2978, 399--401. E. Szemer\u00e9di, Regular partitions of graphs, In: Proc. Colloque Inter. CNRS No. 260 (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau eds.), 2978, 399--401."}],"event":{"name":"STOC05: Symposium on Theory of Computing","location":"Baltimore MD USA","acronym":"STOC05","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"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.1060612","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T03:26:29Z","timestamp":1673148389000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060590.1060612"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,22]]},"references-count":15,"alternative-id":["10.1145\/1060590.1060612","10.1145\/1060590"],"URL":"https:\/\/doi.org\/10.1145\/1060590.1060612","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"}}]}}