{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T22:56:49Z","timestamp":1730329009992,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,6,9]]},"DOI":"10.1145\/780542.780644","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T17:18:43Z","timestamp":1082395123000},"page":"700-709","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Testing subgraphs in directed graphs"],"prefix":"10.1145","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}]},{"given":"Asaf","family":"Shapira","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2003,6,9]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/874063.875540"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1006\/jagm.1994.1005"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/509907.509945"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/795666.796550"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/SFFCS.1999.814642"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1137\/S0097539700366528"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1137\/S0895480199358655"},{"unstructured":"N. Alon M. Krivelevich and B. Sudakov Turan numbers of bipartite graphs and related Ramsey-type questions submitted.]] N. Alon M. Krivelevich and B. Sudakov Turan numbers of bipartite graphs and related Ramsey-type questions submitted.]]","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of the 13th Annual ACM-SIAM SODA","author":"Alon N.","year":"2002","unstructured":"N. Alon and A. Shapira , Testing satisfiability , Proc. of the 13th Annual ACM-SIAM SODA , ACM Press ( 2002 ), 645--654. Also : J. of Algorithms , to appear.]] N. Alon and A. Shapira, Testing satisfiability, Proc. of the 13th Annual ACM-SIAM SODA, ACM Press (2002), 645--654. Also: J. of Algorithms, to appear.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1016\/0166-218X(90)90017-7"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc.\\ National Academy of Sciences USA 32","author":"Behrend F. A.","year":"1946","unstructured":"F. A. Behrend , On sets of integers which contain no three terms in arithmetic progression , Proc.\\ National Academy of Sciences USA 32 ( 1946 ), 331--332.]] F. A. Behrend, On sets of integers which contain no three terms in arithmetic progression, Proc.\\ National Academy of Sciences USA 32 (1946), 331--332.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.5555\/645413.652193"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1016\/S0167-5060(08)70495-3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.5555\/646254.684238"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.5555\/647910.740467"},{"volume-title":"Graph Theory","year":"2000","unstructured":"Reinhard Diestel , Graph Theory , Second Edition, Springer-Verlag , New York , 2000 .]] Reinhard Diestel, Graph Theory, Second Edition, Springer-Verlag, New York, 2000.]]","key":"e_1_3_2_1_16_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1007\/BF02759942"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/BF02579292"},{"key":"e_1_3_2_1_19_1","first-page":"97","article-title":"The art of uninformed decisions: A primer to property testing","volume":"75","author":"Fischer E.","year":"2001","unstructured":"E. Fischer , 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 75 ( 2001 ), 97 -- 126 .]] E. Fischer, 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 75 (2001), 97--126.]]","journal-title":"The Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/s004930050052"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/285055.285060"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.5555\/874063.875543"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1007\/PL00001621"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1016\/0012-365X(92)90282-K"},{"key":"e_1_3_2_1_25_1","first-page":"271","volume-title":"Combinatorics, Paul Erd\\Hos is Eighty, (D. Miklos et. al","author":"Hell P.","year":"1996","unstructured":"P. Hell , J. Nesetril , and X. Zhu , Duality of graph homomorphisms , in: Combinatorics, Paul Erd\\Hos is Eighty, (D. Miklos et. al , eds.), Bolyai Society Mathematical Studies , Vol .2, 1996 , pp. 271 -- 282 .]] P. Hell, J. Nesetril, and X. Zhu, Duality of graph homomorphisms, in: Combinatorics, Paul Erd\\Hos is Eighty, (D. Miklos et. al, eds.), Bolyai Society Mathematical Studies, Vol.2, 1996, pp. 271--282.]]"},{"key":"e_1_3_2_1_26_1","first-page":"295","volume-title":"Combinatorics, Paul Erdos is Eighty, (D. Miklos et. al","author":"Komlos J.","year":"1996","unstructured":"J. Komlos and M. Simonovits , Szemeredi's regularity lemma and its applications in graph theory , in: Combinatorics, Paul Erdos is Eighty, (D. Miklos et. al , eds.), Bolyai Society Mathematical Studies , Vol .2, 1996 , pp. 295 -- 352 .]] J. Komlos and M. Simonovits, Szemeredi's regularity lemma and its applications in graph theory, in: Combinatorics, Paul Erdos is Eighty, (D. Miklos et. al, eds.), Bolyai Society Mathematical Studies, Vol.2, 1996, pp. 295--352.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1007\/BF02582932"},{"key":"e_1_3_2_1_28_1","volume-title":"Handbook of Randomized Computing","author":"Ron D.","year":"2001","unstructured":"D. Ron , Property testing , in: P. M. Pardalos, S. Rajasekaran, J. Reif and J. D. P. Rolim, editors, Handbook of Randomized Computing , Vol. II , Kluwer Academic Publishers , 2001 , 597--649.]] D. Ron, Property testing, in: P. M. Pardalos, S. Rajasekaran, J. Reif and J. D. P. Rolim, editors, Handbook of Randomized Computing, Vol. II, Kluwer Academic Publishers, 2001, 597--649.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1137\/S0097539793255151"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las~Vergnas and D. Sotteau, eds.)","author":"Szemeredi E.","year":"1978","unstructured":"E. Szemeredi , Regular partitions of graphs , In: Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las~Vergnas and D. Sotteau, eds.) , 1978 , 399--401.]] E. Szemeredi, Regular partitions of graphs, In: Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las~Vergnas and D. Sotteau, eds.), 1978, 399--401.]]"},{"key":"e_1_3_2_1_31_1","volume-title":"Proc. of the 18th IEEE FOCS","author":"Yao A. C.","year":"1977","unstructured":"A. C. Yao , Probabilistic computation , towards a unified measure of complexity . Proc. of the 18th IEEE FOCS ( 1977 ), 222--227.]] A. C. Yao, Probabilistic computation, towards a unified measure of complexity. Proc. of the 18th IEEE FOCS (1977), 222--227.]]"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC03","name":"STOC03: The 35th Annual ACM Symposium on Theory of Computing","location":"San Diego CA USA"},"container-title":["Proceedings of the thirty-fifth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/780542.780644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T05:38:46Z","timestamp":1672983526000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/780542.780644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6,9]]},"references-count":31,"alternative-id":["10.1145\/780542.780644","10.1145\/780542"],"URL":"https:\/\/doi.org\/10.1145\/780542.780644","relation":{},"subject":[],"published":{"date-parts":[[2003,6,9]]},"assertion":[{"value":"2003-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}