{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:23Z","timestamp":1725574103377},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_26","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:32:30Z","timestamp":1294439550000},"page":"302-317","source":"Crossref","is-referenced-by-count":16,"title":["Distribution-Free Property Testing"],"prefix":"10.1007","author":[{"given":"Shirley","family":"Halevy","sequence":"first","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Dar, S., Parnas, M., Ron, D.: Testing of clustering. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 240\u2013251 (2000)","DOI":"10.1109\/SFCS.2000.892111"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 656\u2013666 (1999)","DOI":"10.1109\/SFFCS.1999.814642"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing low-degree polynomials over GF(2). To appear in Proceedings of Random 2003 (2003)","DOI":"10.1007\/978-3-540-45198-3_17"},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"1842","DOI":"10.1137\/S0097539700366528","volume":"30","author":"N. Alon","year":"2001","unstructured":"Alon, N., Krivelevich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. SIAM Journal on Computing\u00a030, 1842\u20131862 (2001); also appeared in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 645\u2013655 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR5","unstructured":"Alon, N., Shapira, A.: Testing satisfiablity. In: Proccedings of 13th SODA (2001)"},{"issue":"1","key":"26_CR6","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. JACM\u00a045(1), 501\u2013555 (1998); preliminary version appeared in Proc. 33th FOCS (1992)","journal-title":"JACM"},{"issue":"1","key":"26_CR7","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checkable proofs: A new characterization of NP. JACM\u00a045(1), 70\u2013122 (1998); a preliminary version appeared in Proc. 33rd FOCS (1992)","journal-title":"JACM"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Arora, S., Sudan, M.: Improved low-degree testing and its applications. In: Proceedings of the 29th ACM STOC, pp. 485\u2013495 (1997)","DOI":"10.1145\/258533.258642"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Batu, T., Rubinfeld, R., White, P.: Fast approximation PCPs for multidimensional bin-packing problems. In: Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, pp. 246\u2013256 (1999)","DOI":"10.1007\/978-3-540-48413-4_25"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M. Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self testing\/correcting with applications to numerical problems. Journal of Computer and System Sceince\u00a047, 549\u2013595 (1993)","journal-title":"Journal of Computer and System Sceince"},{"key":"26_CR11","unstructured":"Bshouty, N.: Private communication"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-48224-5_41","volume-title":"Automata, Languages and Programming","author":"A. Czumaj","year":"2001","unstructured":"Czumaj, A., Sohler, C.: Testing hypergraph coloring. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 493\u2013505. Springer, Heidelberg (2001)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D., Samorodnitsky, A.: Improved testing algorithms for monotonicity. In: Proceedings of the 3 rd International Workshop on Randomized and Approximation Techniques in Computer Science, pp. 97\u2013108 (1999)","DOI":"10.1007\/978-3-540-48413-4_10"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Erg\u00fcn, E., Kannan, S., Kumar, R., Rubinfeld, R., Viswanathan, M.: Spotcheckers. Journal of Computing and System Science\u00a060, 717\u2013751 (2000); a preliminary version appeared in Proc. 30th STOC (1998)","DOI":"10.1006\/jcss.1999.1692"},{"key":"26_CR15","unstructured":"Fischer, E.: On the strength of comparisons in property testing (manuscript) (available at ECCC TR00-083)"},{"key":"26_CR16","first-page":"97","volume":"75","author":"E. Fischer","year":"2001","unstructured":"Fischer, E.: 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\u00a075, 97\u2013126 (2001)","journal-title":"The Computational Complexity Column of The bulletin of the European Association for Theoretical Computer Science"},{"key":"26_CR17","unstructured":"Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing Juntas. In: Proceedings of the 43rd FOCS, pp. 103\u2013112 (2002)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Fischer, E., Lehman, E., Newman, I., Raskhodnikova, S., Rubinfeld, R., Samorodnitsky, A.: Monotonicity testing over general poset domains. In: Proceedings of the 34th ACM STOC, pp. 474\u2013483 (2002)","DOI":"10.1145\/509907.509977"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Fischer, E., Newman, I.: Testing of matrix properties. In: Proceedings of the 33rd ACM STOC, pp. 286\u2013295 (2001)","DOI":"10.1145\/380752.380812"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Gemmell, P., Lipton, R., Rubinfeld, R., Sudan, M., Wigderson, A.: Self testing\/ correcting for polynomials and for approximate functions. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 32\u201342 (1991)","DOI":"10.1145\/103418.103429"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Combinatorical property testing \u2013 a survey. In: Pardalos, P., Rajasekaran, S., Rolim, J. (eds.) Randomized Methods in Algorithms Design, AMSDIMACS, pp. 45\u201361 (1998)","DOI":"10.1090\/dimacs\/043\/04"},{"issue":"3","key":"26_CR22","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s004930070011","volume":"20","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samorodnitsky, A.: Testing Monotonicity. Combinatorica\u00a020(3), 301\u2013337 (2000) (a preliminary version appeared in Proc. 39th FOCS, 1998)","journal-title":"Testing Monotonicity. Combinatorica"},{"issue":"4","key":"26_CR23","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Propert testing and its connection to learning and approximation. Journal of the ACM\u00a045(4), 653\u2013750 (1998) (a preliminary version appeared in Proc. 37th FOCS, 1996)","journal-title":"Journal of the ACM"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ron, D.: Property testing in bounded degree graphs. In: Proccedings of the 31st Annual ACM Symposium on the Theory of Computing, pp. 406\u2013415 (1997)","DOI":"10.1145\/258533.258627"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Trevisan, L.: Three theorems regarding testing graph properties. In: Proceedings of FOCS 2001, pp. 460\u2013469 (2001)","DOI":"10.1109\/SFCS.2001.959922"},{"key":"26_CR26","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An introduction to Computational Learning Theory","author":"M.J. Kearns","year":"1994","unstructured":"Kearns, M.J., Vzirani, U.V.: An introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Kohayakawa, Y., Nagle, B., Rodl, V.: Efficient testing of hypergraphs. In: Proceedings of ICALP 2002 (2002)","DOI":"10.1007\/3-540-45465-9_87"},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"Newman, I.: Testing of functions that have small width branching programs. In: Proceedings of the 41st Annual Symposium of Foundations of Computer Science, pp. 251\u2013258 (2000)","DOI":"10.1109\/SFCS.2000.892112"},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Parnas, M., Ron, D.: Testing metric properties. In: Proceedings of the 33rd ACM STOC, pp. 276\u2013285 (2001)","DOI":"10.1145\/380752.380811"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Parnas, M., Ron, D.: Testing the diameter of graphs. In: RANDOM APPROX, pp. 85\u201396 (1999)","DOI":"10.1007\/978-3-540-48413-4_9"},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"Parnas, M., ron, D., Rubinfeld, R.: Testing parenthesis languages. In: Proceedings of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science, pp. 261\u2013272 (2001)","DOI":"10.1007\/3-540-44666-4_29"},{"key":"26_CR32","doi-asserted-by":"crossref","unstructured":"Parnas, M., Ron, D., Samorodnitsky, A.: Proclaiming dictators and juntas ot testing boolean formulae. In: RANDOM APPROX, pp. 273\u2013284 (2001)","DOI":"10.1007\/3-540-44666-4_30"},{"key":"26_CR33","volume-title":"Handbook of Randomized Computing","author":"D. Ron","year":"2001","unstructured":"Ron, D.: Property testing (a tutorial). In: Rajasekaran, S., Pardalos, P.M., Reif, J.H., Rolin, J.D.P. (eds.) Handbook of Randomized Computing. Kluwer Press, Dordrecht (2001)"},{"issue":"6","key":"26_CR34","doi-asserted-by":"publisher","first-page":"1972","DOI":"10.1137\/S0097539796298625","volume":"28","author":"R. Rubinfeld","year":"1999","unstructured":"Rubinfeld, R.: Robust functional equations and their applications to program testing. SIAM Journal on Computing\u00a028(6), 1972\u20131997 (1999) (appeared in Proceedings of the 35th Annual Symposium of Foundations of Computer Science, 1994)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"26_CR35","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 applocations to program testing. SIAM Journal of Computing\u00a025(2), 252\u2013271 (1996) (first appeared as a technical report, Cornell University, 1993)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T14:05:16Z","timestamp":1559916316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}