{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:29Z","timestamp":1725567569029},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","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-16367-8_23","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T15:25:55Z","timestamp":1286465155000},"page":"295-305","source":"Crossref","is-referenced-by-count":4,"title":["Algorithmic Aspects of Property Testing in the Dense Graphs Model"],"prefix":"10.1007","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Ron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF02761855","volume":"38","author":"N. Alon","year":"1981","unstructured":"Alon, N.: On the number of subgraphs of prescribed type of graphs with a given number of edges. Israel J.\u00a0Math.\u00a038, 116\u2013130 (1981)","journal-title":"Israel J.\u00a0Math."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s004930070001","volume":"20","author":"N. Alon","year":"2000","unstructured":"Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient Testing of Large Graphs. Combinatorica\u00a020, 451\u2013476 (2000)","journal-title":"Combinatorica"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/050627915","volume":"37","author":"N. Alon","year":"2007","unstructured":"Alon, N., Fischer, E., Newman, I.: Testing of bipartite graph properties. SIAM Journal on Computing\u00a037, 959\u2013976 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Fischer, E., Newman, I., Shapira, A.: A Combinatorial Characterization of the Testable Graph Properties: It\u2019s All About Regularity. In: 38th STOC, pp. 251\u2013260 (2006)","DOI":"10.1145\/1132516.1132555"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1017\/S0963548306007759","volume":"15","author":"N. Alon","year":"2006","unstructured":"Alon, N., Shapira, A.: A Characterization of Easily Testable Induced Subgraphs. Combinatorics Probability and Computing\u00a015, 791\u2013805 (2006)","journal-title":"Combinatorics Probability and Computing"},{"key":"23_CR6","unstructured":"Avigad, L.: On the Lowest Level of Query Complexity in Testing Graph Properties. Master Thesis, Weizmann Institute of Scienc (December 2009)"},{"key":"23_CR7","unstructured":"Avigad, L., Goldreich, O.: Testing Graph Blow-Up, http:\/\/www.wisdom.weizmann.ac.il\/~oded\/p_lidor.html"},{"issue":"1","key":"23_CR8","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.: 3CNF properties are hard to test. SIAM Journal on Computing\u00a035(1), 1\u201321 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Trevisan, L.: Lower Bounds for Testing Bipartiteness in Dense Graphs. In: IEEE Conference on Computational Complexity, pp. 75\u201381 (2004)","DOI":"10.1109\/CCC.2004.1313803"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(94)00171-T","volume":"53","author":"R. Canetti","year":"1995","unstructured":"Canetti, R., Even, G., Goldreich, O.: Lower Bounds for Sampling Algorithms for Estimating the Average. IPL\u00a053, 17\u201325 (1995)","journal-title":"IPL"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ic.2003.09.003","volume":"189","author":"E. Fischer","year":"2004","unstructured":"Fischer, E.: On the strength of comparisons in property testing. Inform. and Comput.\u00a0189(1), 107\u2013116 (2004)","journal-title":"Inform. and Comput."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM, 653\u2013750 (July 1998)","DOI":"10.1145\/285055.285060"},{"issue":"2","key":"23_CR13","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00453-001-0078-7","volume":"32","author":"O. Goldreich","year":"2002","unstructured":"Goldreich, O., Ron, D.: Property Testing in Bounded Degree Graphs. Algorithmica\u00a032(2), 302\u2013343 (2002)","journal-title":"Algorithmica"},{"key":"23_CR14","unstructured":"Goldreich, O., Ron, D.: Algorithmic Aspects of Property Testing in the Dense Graphs Model. ECCC, TR08-039 (2008)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ron, D.: On Proximity Oblivious Testing. In: Extended Abstract in the Proceedings of the 41st STOC (2009)","DOI":"10.1145\/1536414.1536436"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/rsa.10078","volume":"23","author":"O. Goldreich","year":"2003","unstructured":"Goldreich, O., Trevisan, L.: Three theorems regarding testing graph properties. Random Structures and Algorithms\u00a023(1), 23\u201357 (2003)","journal-title":"Random Structures and Algorithms"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-540-74208-1_38","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Gonen","year":"2007","unstructured":"Gonen, M., Ron, D.: On the Benefit of Adaptivity in Property Testing of Dense Graphs. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 525\u2013539. Springer, Heidelberg (2007)"},{"issue":"3","key":"23_CR18","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1561\/2200000004","volume":"1","author":"D. Ron","year":"2008","unstructured":"Ron, D.: Property Testing: A Learning Theory Perspective. Foundations and Trends in Machine Learning\u00a01(3), 307\u2013402 (2008)","journal-title":"Foundations and Trends in Machine Learning"},{"issue":"2","key":"23_CR19","first-page":"73","volume":"5","author":"D. Ron","year":"2010","unstructured":"Ron, D.: Algorithmic and Analysis Techniques in Property Testing. Foundations and Trends in TCS\u00a05(2), 73\u2013205 (2010)","journal-title":"Foundations and Trends in TCS"},{"key":"23_CR20","unstructured":"Raskhodnikova, S., Smith, A.: A note on adaptivity in testing properties of bounded-degree graphs. ECCC,TR06-089 (2006)"},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing\u00a025(2), 252\u2013271 (1996)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T18:22:04Z","timestamp":1685816524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}