{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T04:10:01Z","timestamp":1740543001704,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282396"},{"type":"electronic","value":"9783540318743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538462_28","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T04:13:22Z","timestamp":1285647202000},"page":"330-341","source":"Crossref","is-referenced-by-count":4,"title":["A Lower Bound for Distribution-Free Monotonicity Testing"],"prefix":"10.1007","author":[{"given":"Shirley","family":"Halevy","sequence":"first","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. In: FOCS 1999, pp. 656\u2013666 (1999)","DOI":"10.1109\/SFFCS.1999.814642"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-540-48413-4_25","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"T. Batu","year":"1999","unstructured":"Batu, T., Rubinfeld, R., White, P.: Fast approximation PCPs for multidimensional bin-packing problems. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 245\u2013256. Springer, Heidelberg (1999)"},{"key":"28_CR3","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 Science\u00a047, 549\u2013595 (1993)","journal-title":"Journal of Computer and System Science"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Obata, K., Trevisan, L.: A lower bound for testing 3-colorability in bounded-degree graphs. In: FOCS 2002, pp. 93\u2013102 (2002)","DOI":"10.1109\/SFCS.2002.1181886"},{"key":"28_CR5","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":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-540-48413-4_10","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"Y. Dodis","year":"1999","unstructured":"Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D., Samorodnitsky, A.: Improved testing algorithms for monotonicity. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 97\u2013108. Springer, Heidelberg (1999)"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1006\/jcss.1999.1692","volume":"60","author":"E. Erg\u00fcn","year":"2000","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 STOC 1998)","journal-title":"Journal of Computing and System Science"},{"key":"28_CR8","unstructured":"Fischer, E.: On the strength of comparisons in property testing (available at ECCC 8(8) (2001) (manuscript)"},{"key":"28_CR9","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":"28_CR10","doi-asserted-by":"crossref","unstructured":"Fischer, E., Lehman, E., Newman, I., Raskhodnikova, S., Rubinfeld, R., Samorodnitsky, A.: Monotonicity testing over general poset domains. In: STOC 2002, pp. 474\u2013483 (2002)","DOI":"10.1145\/509907.509977"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Fischer, E., Newman, I.: Testing of matrix properties. In: STOC 2001, pp. 286\u2013 295 (2001)","DOI":"10.1145\/380752.380812"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Combinatorical property testing \u2013 a survey. In: Randomized Methods in Algorithms Design, AMS-DIMACS, pp. 45\u201361 (1998)","DOI":"10.1090\/dimacs\/043\/04"},{"issue":"3","key":"28_CR13","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., Samorodnitsky, A.: Testing Monotonicity. Combinatorica\u00a020(3), 301\u2013337 (2000) (a preliminary version appeared in FOCS 1998)","journal-title":"Combinatorica"},{"issue":"4","key":"28_CR14","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) (a preliminary version appeared in FOCS 1996)","journal-title":"Journal of the ACM"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ron, D.: Property testing in bounded degree graphs. In: STOC 1997, pp. 406\u2013415 (1997)","DOI":"10.1145\/258533.258627"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Trevisan, L.: Three theorems regarding testing graph properties. In: FOCS 2001, pp. 302\u2013317 (2001)","DOI":"10.1109\/SFCS.2001.959922"},{"key":"28_CR17","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)"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/978-3-540-27836-8_61","volume-title":"Automata, Languages and Programming","author":"S. Halevy","year":"2004","unstructured":"Halevy, S., Kushilevitz, E.: Testing monotonicity over graph products. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 721\u2013732. Springer, Heidelberg (2004)"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-27821-4_35","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S. Halevy","year":"2004","unstructured":"Halevy, S., Kushilevitz, E.: Distribution-free connectivity testing. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 393\u2013404. Springer, Heidelberg (2004)"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/978-3-540-45198-3_29","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"T. Kaufman","year":"2003","unstructured":"Kaufman, T., Krivelevich, M., Ron, D.: Tight bounds for testing bipartiteness in general graphs. 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)"},{"key":"28_CR21","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":"28_CR22","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":"2","key":"28_CR23","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 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\/11538462_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T03:06:32Z","timestamp":1740539192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538462_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282396","9783540318743"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11538462_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}