{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:38:19Z","timestamp":1787503099201,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100005386","name":"Israeli Centers for Research Excellence","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210401","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T13:46:44Z","timestamp":1531403204000},"page":"153-162","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Possibilities and Impossibilities for Distributed Subgraph Detection"],"prefix":"10.1145","author":[{"given":"Orr","family":"Fischer","sequence":"first","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tzlil","family":"Gonen","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[{"name":"University of Freiburg, Freiburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rotem","family":"Oshman","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion. CoRR","author":"Abboud Amir","year":"2017"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400757"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0132-x"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548316000134"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Keren Censor-Hillel Eldar Fischer Gregory Schwartzman and Yadu Vasudev . 2016. Fast Distributed Algorithms for Testing Graph Properties. 43--56.  Keren Censor-Hillel Eldar Fischer Gregory Schwartzman and Yadu Vasudev . 2016. Fast Distributed Algorithms for Testing Graph Properties. 43--56.","DOI":"10.1007\/978-3-662-53426-7_4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767414"},{"key":"e_1_3_2_1_8_1","volume-title":"Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model 31st International Symposium on Distributed Computing, DISC 2017, October 16--20","author":"Censor-Hillel Keren","year":"2017"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_14"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"P. Erd\u00f6s. . 1964. On extremal problems of graphs and generalized graphs. IJoM (1964).  P. Erd\u00f6s. . 1964. On extremal problems of graphs and generalized graphs. IJoM (1964).","DOI":"10.1007\/BF02759942"},{"key":"e_1_3_2_1_12_1","volume-title":"Three Notes on Distributed Property Testing. In 31st International Symposium on Distributed Computing (DISC 2017) (Leibniz International Proceedings in Informatics (LIPIcs))","volume":"91","author":"Even Guy","year":"2017"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087571"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Pierre Fraigniaud Ivan Rapaport Ville Salo and Ioan Todinca . 2016. Distributed Testing of Excluded Subgraphs. 342--356.  Pierre Fraigniaud Ivan Rapaport Ville Salo and Ioan Todinca . 2016. Distributed Testing of Excluded Subgraphs. 342--356.","DOI":"10.1007\/978-3-662-53426-7_25"},{"key":"e_1_3_2_1_15_1","unstructured":"Tzlil Gonen and Rotem Oshman . 2017. Lower Bounds for Subgraph Detection in the CONGEST Model. To appear in OPODIS 2017.  Tzlil Gonen and Rotem Oshman . 2017. Lower Bounds for Subgraph Detection in the CONGEST Model. To appear in OPODIS 2017."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087811"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405044"},{"key":"e_1_3_2_1_18_1","volume-title":"Deterministic Subgraph Detection in Broadcast CONGEST 21st International Conference on Principles of Distributed Systems, OPODIS 2017","author":"Janne","year":"2017"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Eyal Kushilevitz and Noam Nisan . 1997. Communication Complexity. Cambridge University Press.   Eyal Kushilevitz and Noam Nisan . 1997. Communication Complexity. Cambridge University Press.","DOI":"10.1017\/CBO9780511574948"},{"key":"e_1_3_2_1_20_1","unstructured":"Gopal Pandurangan Peter Robinson and Michele Scquizzato . 2016. Tight Bounds for Distributed Graph Computations. CoRR (2016). deftempurl%http:\/\/arxiv.org\/abs\/1602.08481 tempurl  Gopal Pandurangan Peter Robinson and Michele Scquizzato . 2016. Tight Bounds for Distributed Graph Computations. CoRR (2016). deftempurl%http:\/\/arxiv.org\/abs\/1602.08481 tempurl"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-8858(02)00037-4"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Vienna Austria","acronym":"SPAA '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210401","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:39:20Z","timestamp":1750196360000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":24,"alternative-id":["10.1145\/3210377.3210401","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210401","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}