{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:30:03Z","timestamp":1758274203476,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["755839"],"award-info":[{"award-number":["755839"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"JSPS","award":["KAKENHI grants 19K20216 and 21K17703"],"award-info":[{"award-number":["KAKENHI grants 19K20216 and 21K17703"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461788","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"140-150","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding Subgraphs in Highly Dynamic Networks"],"prefix":"10.1145","author":[{"given":"Keren","family":"Censor-Hillel","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Victor I.","family":"Kolobov","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Gregory","family":"Schwartzman","sequence":"additional","affiliation":[{"name":"JAIST, Nomi, Japan"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316376"},{"key":"e_1_3_2_1_2_1","volume-title":"Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion. CoRR abs\/1711.01623","author":"Abboud Amir","year":"2017","unstructured":"Amir Abboud , Keren Censor-Hillel , Seri Khoury , and Christoph Lenzen . 2017 . Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion. CoRR abs\/1711.01623 (2017). arXiv:1711.01623 http:\/\/arxiv. org\/abs\/1711.01623 Amir Abboud, Keren Censor-Hillel, Seri Khoury, and Christoph Lenzen. 2017. Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion. CoRR abs\/1711.01623 (2017). arXiv:1711.01623 http:\/\/arxiv. org\/abs\/1711.01623"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188922"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486170"},{"key":"e_1_3_2_1_5_1","volume-title":"Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. In IEEE 56th Annual Symp. on Foundations of Computer Science, FOCS 2015","author":"Augustine John","year":"2015","unstructured":"John Augustine , Gopal Pandurangan , Peter Robinson , Scott T. Roche , and Eli Upfal . 2015 . Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. In IEEE 56th Annual Symp. on Foundations of Computer Science, FOCS 2015 , Berkeley, CA, USA, 17- -20 October, 2015. 350--369. https: \/\/doi.org\/10.1109\/FOCS.2015.29 John Augustine, Gopal Pandurangan, Peter Robinson, Scott T. Roche, and Eli Upfal. 2015. Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. In IEEE 56th Annual Symp. on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17--20 October, 2015. 350--369. https: \/\/doi.org\/10.1109\/FOCS.2015.29"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.47"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00015"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.113"},{"key":"e_1_3_2_1_9_1","volume-title":"ICALP 2019","author":"Bonne Matthias","year":"2019","unstructured":"Matthias Bonne and Keren Censor-Hillel . 2019 . Distributed Detection of Cliques in Dynamic Networks. In 46th Int'l Colloquium on Automata, Languages, and Programming , ICALP 2019 , July 9 --12 , 2019, Patras, Greece. 132:1--132:15. https: \/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.132 Matthias Bonne and Keren Censor-Hillel. 2019. Distributed Detection of Cliques in Dynamic Networks. In 46th Int'l Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9--12, 2019, Patras, Greece. 132:1--132:15. https: \/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.132"},{"key":"e_1_3_2_1_10_1","volume-title":"Fran\u00e7ois Le Gall, and Dean Leitersdorf","author":"Censor-Hillel Keren","year":"2021","unstructured":"Keren Censor-Hillel , Yi-Jun Chang , Fran\u00e7ois Le Gall, and Dean Leitersdorf . 2021 . Tight Distributed Listing of Cliques. In SODA. Keren Censor-Hillel, Yi-Jun Chang, Fran\u00e7ois Le Gall, and Dean Leitersdorf. 2021. Tight Distributed Listing of Cliques. In SODA."},{"key":"e_1_3_2_1_11_1","unstructured":"Keren Censor-Hillel Neta Dafni Victor I. Kolobov Ami Paz and Gregory Schwartzman. 2020. Fast and Simple Deterministic Algorithms for HighlyDynamic Networks. In OPODIS.  Keren Censor-Hillel Neta Dafni Victor I. Kolobov Ami Paz and Gregory Schwartzman. 2020. Fast and Simple Deterministic Algorithms for HighlyDynamic Networks. In OPODIS."},{"key":"e_1_3_2_1_12_1","volume-title":"On Distributed Listing of Cliques. In PODC '20: ACM Symp. on Principles of Distributed Computing","author":"Censor-Hillel Keren","year":"2020","unstructured":"Keren Censor-Hillel , Fran\u00e7ois Le Gall , and Dean Leitersdorf . 2020 . On Distributed Listing of Cliques. In PODC '20: ACM Symp. on Principles of Distributed Computing , Virtual Event, Italy, August 3--7 , 2020. 474--482. https:\/\/doi.org\/10.1145\/3382734. 3405742 Keren Censor-Hillel, Fran\u00e7ois Le Gall, and Dean Leitersdorf. 2020. On Distributed Listing of Cliques. In PODC '20: ACM Symp. on Principles of Distributed Computing, Virtual Event, Italy, August 3--7, 2020. 474--482. https:\/\/doi.org\/10.1145\/3382734. 3405742"},{"volume-title":"Proceedings of the 2016 ACM Symp. on Principles of Distributed Computing (PODC). 217--226","author":"Censor-Hillel Keren","key":"e_1_3_2_1_13_1","unstructured":"Keren Censor-Hillel , Elad Haramaty , and Zohar S. Karnin . 2016. Optimal Dynamic Distributed MIS . In Proceedings of the 2016 ACM Symp. on Principles of Distributed Computing (PODC). 217--226 . https:\/\/doi.org\/10.1145\/2933057.2933083 Keren Censor-Hillel, Elad Haramaty, and Zohar S. Karnin. 2016. Optimal Dynamic Distributed MIS. In Proceedings of the 2016 ACM Symp. on Principles of Distributed Computing (PODC). 217--226. https:\/\/doi.org\/10.1145\/2933057.2933083"},{"key":"e_1_3_2_1_14_1","volume-title":"Finding Subgraphs in Highly Dynamic Networks. CoRR abs\/2009.08208","author":"Censor-Hillel Keren","year":"2020","unstructured":"Keren Censor-Hillel , Victor I. Kolobov , and Gregory Schwartzman . 2020. Finding Subgraphs in Highly Dynamic Networks. CoRR abs\/2009.08208 ( 2020 ). arXiv:2009.08208 https:\/\/arxiv.org\/abs\/2009.08208 Keren Censor-Hillel, Victor I. Kolobov, and Gregory Schwartzman. 2020. Finding Subgraphs in Highly Dynamic Networks. CoRR abs\/2009.08208 (2020). arXiv:2009.08208 https:\/\/arxiv.org\/abs\/2009.08208"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.51"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331618"},{"key":"e_1_3_2_1_17_1","volume-title":"Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. FOCS","author":"Chang Yi-Jun","year":"2020","unstructured":"Yi-Jun Chang and Thatchaphol Saranurak . 2020. Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. FOCS ( 2020 ). Yi-Jun Chang and Thatchaphol Saranurak. 2020. Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. FOCS (2020)."},{"key":"e_1_3_2_1_18_1","volume-title":"DISC 2018","author":"Czumaj Artur","year":"2018","unstructured":"Artur Czumaj and Christian Konrad . 2018 . Detecting Cliques in CONGEST Networks. In 32nd Int'l Symp. on Distributed Computing , DISC 2018 , New Orleans, LA, USA, October 15--19 , 2018. 16:1--16:15. https:\/\/doi.org\/10.4230\/LIPIcs.DISC. 2018.16 Artur Czumaj and Christian Konrad. 2018. Detecting Cliques in CONGEST Networks. In 32nd Int'l Symp. on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15--19, 2018. 16:1--16:15. https:\/\/doi.org\/10.4230\/LIPIcs.DISC. 2018.16"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Shlomi Dolev. 2000. Self-Stabilization. MIT Press.  Shlomi Dolev. 2000. Self-Stabilization. MIT Press.","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_1_21_1","volume-title":"DISC 2019","author":"Eden Talya","year":"2019","unstructured":"Talya Eden , Nimrod Fiat , Orr Fischer , Fabian Kuhn , and Rotem Oshman . 2019 . Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. In 33rd Int'l Symp. on Distributed Computing , DISC 2019 , October 14 --18 , 2019, Budapest, Hungary. 15:1--15:16. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2019.15 Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, and Rotem Oshman. 2019. Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. In 33rd Int'l Symp. on Distributed Computing, DISC 2019, October 14--18, 2019, Budapest, Hungary. 15:1--15:16. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2019.15"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, IMC 2007","author":"Falkner Jarret","year":"2007","unstructured":"Jarret Falkner , Michael Piatek , John P. John , Arvind Krishnamurthy , and Thomas E. Anderson . 2007. Profiling a million user dht . In Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, IMC 2007 , San Diego, California, USA, October 24--26 , 2007 , Constantine Dovrolis and Matthew Roughan (Eds.). ACM, 129--134. https:\/\/doi.org\/10.1145\/1298306.1298325 Jarret Falkner, Michael Piatek, John P. John, Arvind Krishnamurthy, and Thomas E. Anderson. 2007. Profiling a million user dht. In Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, IMC 2007, San Diego, California, USA, October 24--26, 2007, Constantine Dovrolis and Matthew Roughan (Eds.). ACM, 129--134. https:\/\/doi.org\/10.1145\/1298306.1298325"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210401"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 19th ACM Symp. on Operating Systems Principles 2003, SOSP 2003","author":"Gummadi P. Krishna","year":"2003","unstructured":"P. Krishna Gummadi , Richard J. Dunn , Stefan Saroiu , Steven D. Gribble , Henry M. Levy , and John Zahorjan . 2003 . Measurement, modeling, and analysis of a peerto-peer file-sharing workload . In Proceedings of the 19th ACM Symp. on Operating Systems Principles 2003, SOSP 2003 , Bolton Landing, NY, USA, October 19--22 , 2003. 314--329. https:\/\/doi.org\/10.1145\/945445.945475 P. Krishna Gummadi, Richard J. Dunn, Stefan Saroiu, Steven D. Gribble, Henry M. Levy, and John Zahorjan. 2003. Measurement, modeling, and analysis of a peerto-peer file-sharing workload. In Proceedings of the 19th ACM Symp. on Operating Systems Principles 2003, SOSP 2003, Bolton Landing, NY, USA, October 19--22, 2003. 314--329. https:\/\/doi.org\/10.1145\/945445.945475"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/510726.510756"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055493"},{"key":"e_1_3_2_1_27_1","first-page":"P4","article-title":"Large Cuts with Local Algorithms on Triangle-Free Graphs","volume":"24","author":"Hirvonen Juho","year":"2017","unstructured":"Juho Hirvonen , Joel Rybicki , Stefan Schmid , and Jukka Suomela . 2017 . Large Cuts with Local Algorithms on Triangle-Free Graphs . Electr. J. Comb. 24 , 4 (2017), P4 .21. http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i4p21 Juho Hirvonen, Joel Rybicki, Stefan Schmid, and Jukka Suomela. 2017. Large Cuts with Local Algorithms on Triangle-Free Graphs. Electr. J. Comb. 24, 4 (2017), P4.21. http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i4p21","journal-title":"Electr. J. Comb."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.105"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the ACM SIGCOMM 2010 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications","author":"Isdal Tomas","year":"2010","unstructured":"Tomas Isdal , Michael Piatek , Arvind Krishnamurthy , and Thomas E. Anderson . 2010. Privacy-preserving P2P data sharing with OneSwarm . In Proceedings of the ACM SIGCOMM 2010 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications , New Delhi, India, August 30 - September 3, 2010 . 111--122. https:\/\/doi.org\/10.1145\/1851182.1851198 Tomas Isdal, Michael Piatek, Arvind Krishnamurthy, and Thomas E. Anderson. 2010. Privacy-preserving P2P data sharing with OneSwarm. In Proceedings of the ACM SIGCOMM 2010 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, New Delhi, India, August 30 -September 3, 2010. 111--122. https:\/\/doi.org\/10.1145\/1851182.1851198"},{"key":"e_1_3_2_1_30_1","volume-title":"Dynamic Algorithms for the Massively Parallel Computation Model. In The 31st ACM on Symp. on Parallelism in Algorithms and Architectures, SPAA 2019","author":"Italiano Giuseppe F.","year":"2019","unstructured":"Giuseppe F. Italiano , Silvio Lattanzi , Vahab S. Mirrokni , and Nikos Parotsidis . 2019 . Dynamic Algorithms for the Massively Parallel Computation Model. In The 31st ACM on Symp. on Parallelism in Algorithms and Architectures, SPAA 2019 , Phoenix, AZ, USA, June 22--24 , 2019. 49--58. https:\/\/doi.org\/10.1145\/3323165.3323202 Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, and Nikos Parotsidis. 2019. Dynamic Algorithms for the Massively Parallel Computation Model. In The 31st ACM on Symp. on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22--24, 2019. 49--58. https:\/\/doi.org\/10.1145\/3323165.3323202"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087811"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03850-6_14"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806760"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Gopal Pandurangan Peter Robinson and Michele Scquizzato. 2018. On the Distributed Complexity of Large-Scale Graph Computations. In SPAA. ACM 405--414.  Gopal Pandurangan Peter Robinson and Michele Scquizzato. 2018. On the Distributed Complexity of Large-Scale Graph Computations. In SPAA. ACM 405--414.","DOI":"10.1145\/3210377.3210409"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884452"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2014.12.018"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.826277"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.43"},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings of the 6th ACM SIGCOMM Internet Measurement Conference, IMC 2006","author":"Stutzbach Daniel","year":"2006","unstructured":"Daniel Stutzbach and Reza Rejaie . 2006 . Understanding churn in peer-topeer networks . In Proceedings of the 6th ACM SIGCOMM Internet Measurement Conference, IMC 2006 , Rio de Janeriro, Brazil, October 25--27 , 2006, Jussara M. Almeida, Virg\u00edlio A. F. Almeida, and Paul Barford (Eds.). ACM, 189--202. https:\/\/doi.org\/10.1145\/1177080.1177105 Daniel Stutzbach and Reza Rejaie. 2006. Understanding churn in peer-topeer networks. In Proceedings of the 6th ACM SIGCOMM Internet Measurement Conference, IMC 2006, Rio de Janeriro, Brazil, October 25--27, 2006, Jussara M. Almeida, Virg\u00edlio A. F. Almeida, and Paul Barford (Eds.). ACM, 189--202. https:\/\/doi.org\/10.1145\/1177080.1177105"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384258"}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","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"],"location":"Virtual Event USA","acronym":"SPAA '21"},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461788","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":40,"alternative-id":["10.1145\/3409964.3461788","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461788","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}