{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:11Z","timestamp":1794381071468,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_61","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"721-732","source":"Crossref","is-referenced-by-count":9,"title":["Testing Monotonicity over Graph Products"],"prefix":"10.1007","author":[{"given":"Shirley","family":"Halevy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"61_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":"61_CR2","doi-asserted-by":"publisher","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 FOCS 1999, pages 645\u2013655)","journal-title":"SIAM Journal on Computing"},{"key":"61_CR3","doi-asserted-by":"crossref","unstructured":"Batu, T., Rubinfeld, R., White, P.: Fast approximation PCPs for multidimensional bin-packing problems. In: RANDOM-APPROX, pp. 246\u2013256 (1999)","DOI":"10.1007\/978-3-540-48413-4_25"},{"key":"61_CR4","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":"61_CR5","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Obata, K., Trevisan, L.: A lower bound for testing 3-colorability in bounded-degree graphs. In: FOCS, pp. 93\u2013102 (2002)","DOI":"10.1109\/SFCS.2002.1181886"},{"key":"61_CR6","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D., Samorodnitsky, A.: Improved testing algorithms for monotonicity. In: RANDOM-APPROX 1999, pp. 97\u2013108 (1999)","DOI":"10.1007\/978-3-540-48413-4_10"},{"key":"61_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)","journal-title":"Journal of Computing and System Science"},{"key":"61_CR8","unstructured":"Fischer, E.: On the strength of comparisons in property testing (available at ECCC 8(8) (2001)) (manuscript)"},{"key":"61_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":"61_CR10","unstructured":"Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing Juntas. In: FOCS 2002, pp. 103\u2013112 (2002)"},{"key":"61_CR11","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":"61_CR12","doi-asserted-by":"crossref","unstructured":"Fischer, E., Newman, I.: Testing of matrix properties. In: STOC 2001, pp. 286\u2013295 (2001)","DOI":"10.1145\/380752.380812"},{"key":"61_CR13","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":"61_CR14","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":"61_CR15","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":"61_CR16","unstructured":"Goldreich, O., Ron, D.: On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity 7(20) (2000)"},{"key":"61_CR17","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":"61_CR18","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":"61_CR19","doi-asserted-by":"crossref","unstructured":"Halevy, S., Kushilevitz, E.: Distribution-free property testing. In: RANDOMAPPROX 2003, pp. 341\u2013353 (2003)","DOI":"10.1007\/978-3-540-45198-3_26"},{"key":"61_CR20","doi-asserted-by":"crossref","unstructured":"Kaufman, T., Krivelevich, M., Ron, D.: Tight bounds for testing bipartiteness in general graphs. In: RANDOM-APPROX, pp. 341\u2013353 (2003)","DOI":"10.1007\/978-3-540-45198-3_29"},{"key":"61_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/3-540-45465-9_87","volume-title":"Automata, Languages and Programming","author":"Y. Kohayakawa","year":"2002","unstructured":"Kohayakawa, Y., Nagle, B., Rodl, V.: Efficient testing of hypergraphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 1017\u20131028. Springer, Heidelberg (2002)"},{"key":"61_CR22","doi-asserted-by":"crossref","unstructured":"Parnas, M., Ron, D.: Testing the diameter of graphs. In: RANDOM-APPROX 1999, pp. 85\u201396 (1999)","DOI":"10.1007\/978-3-540-48413-4_9"},{"key":"61_CR23","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":"61_CR24","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","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:02Z","timestamp":1605741842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_61","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99859","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}