{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:16Z","timestamp":1725486076125},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729259"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72927-3_1","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:30:27Z","timestamp":1181615427000},"page":"1-2","source":"Crossref","is-referenced-by-count":1,"title":["Property Testing: A Learning Theory Perspective"],"prefix":"10.1007","author":[{"given":"Dana","family":"Ron","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"1704","DOI":"10.1016\/j.ic.2006.06.001","volume":"204","author":"N. Ailon","year":"2006","unstructured":"Ailon, N., Chazelle, B.: Information theory in property testing and monotonicity testing in higher dimensions. Information and Computation\u00a0204, 1704\u20131717 (2006)","journal-title":"Information and Computation"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/S0895480102410973","volume":"16","author":"N. Alon","year":"2003","unstructured":"Alon, N., Dar, S., Parnas, M., Ron, D.: Testing of clustering. SIAM Journal on Discrete Math.\u00a016(3), 393\u2013417 (2003)","journal-title":"SIAM Journal on Discrete Math."},{"key":"1_CR3","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: Proceedings of the Thirty-Eighth Annual ACM Symposium on the Theory of Computing (2006)","DOI":"10.1145\/1132516.1132555"},{"key":"1_CR4","first-page":"549","volume":"47","author":"M. Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. Journal of the ACM\u00a047, 549\u2013595 (1993)","journal-title":"Journal of the ACM"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1006\/jcss.1999.1692","volume":"60","author":"F. Ergun","year":"2000","unstructured":"Ergun, F., Kannan, S., Kumar, S.R., Rubinfeld, R., Viswanathan, M.: Spot-checkers. Journal of Computer and System Sciences\u00a060(3), 717\u2013751 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR6","first-page":"97","volume":"75","author":"E. Fischer","year":"2001","unstructured":"Fischer, E.: The art of uninformed decisions: A primer to property testing. Bulletin of the European Association for Theoretical Computer Science\u00a075, 97\u2013126 (2001)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.jcss.2003.11.004","volume":"68","author":"E. Fischer","year":"2004","unstructured":"Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, S.: Testing juntas. Journal of Computer and System Sciences\u00a068(4), 753\u2013787 (2004)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s004930070011","volume":"20","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samordinsky, A.: Testing monotonicity. Combinatorica\u00a020(3), 301\u2013337 (2000)","journal-title":"Combinatorica"},{"issue":"4","key":"1_CR9","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"Journal of the ACM"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","first-page":"341","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S. Halevy","year":"2003","unstructured":"Halevy, S., Kushilevitz, E.: Distribution-free property testing. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 341\u2013353. Springer, Heidelberg (2003)"},{"issue":"3","key":"1_CR11","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1006\/jcss.1999.1656","volume":"61","author":"M. Kearns","year":"2000","unstructured":"Kearns, M., Ron, D.: Testing problems with sub-learning sample complexity. Journal of Computer and System Sciences\u00a061(3), 428\u2013456 (2000)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2-3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00993468","volume":"17","author":"M.J. Kearns","year":"1994","unstructured":"Kearns, M.J., Schapire, R.E., Sellie, L.M.: Toward efficient agnostic learning. Machine Learning\u00a017(2-3), 115\u2013141 (1994)","journal-title":"Machine Learning"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/S0895480101407444","volume":"16","author":"M. Parnas","year":"2002","unstructured":"Parnas, M., Ron, D., Samorodnitsky, A.: Testing boolean formulae. SIAM Journal on Discrete Math.\u00a016(1), 20\u201346 (2002)","journal-title":"SIAM Journal on Discrete Math"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Ron, D.: Property testing. In: Rajasekaran, S., Pardalos, P. M., Reif, J. H., Rolim, J. D. P.(eds.) Handbook on Randomization, Volume II, pp. 597\u2013649 (2001)","DOI":"10.1007\/978-1-4615-0013-1_15"},{"issue":"2","key":"1_CR15","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","Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72927-3_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T10:40:45Z","timestamp":1683888045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72927-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729259"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72927-3_1","relation":{},"subject":[]}}