{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:49:02Z","timestamp":1782971342478,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Union?s Horizon 2020 Research and Innovation Programme","award":["755839"],"award-info":[{"award-number":["755839"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538434","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"271-280","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Deterministic Near-Optimal Distributed Listing of Cliques"],"prefix":"10.1145","author":[{"given":"Keren","family":"Censor-Hillel","sequence":"first","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dean","family":"Leitersdorf","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Vulakh","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-020-00373-4"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0132-x"},{"key":"e_1_3_2_2_4_1","first-page":"1","article-title":"Distributed Subgraph Finding: Progress and Challenges","volume":"198","author":"Censor-Hillel Keren","year":"2021","unstructured":"Keren Censor-Hillel . 2021 . Distributed Subgraph Finding: Progress and Challenges . In ICALP , Vol. 198. 3: 1 -- 3 :14. Keren Censor-Hillel. 2021. Distributed Subgraph Finding: Progress and Challenges. In ICALP, Vol. 198. 3:1--3:14.","journal-title":"ICALP"},{"key":"e_1_3_2_2_5_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. 2878 -- 2891. Keren Censor-Hillel, Yi-Jun Chang, Fran\u00e7ois Le Gall, and Dean Leitersdorf. 2021. Tight Distributed Listing of Cliques. In SODA. 2878 -- 2891."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0324-8"},{"key":"e_1_3_2_2_7_1","first-page":"1","article-title":"a","volume":"33","author":"Censor-Hillel Keren","year":"2020","unstructured":"Keren Censor-Hillel , Orr Fischer , Tzlil Gonen , Francc ois Le Gall , Dean Leitersdorf , and Rotem Oshman . 2020 a . Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. In DISC. 33 : 1 -- 33 :17. Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, Francc ois Le Gall, Dean Leitersdorf, and Rotem Oshman. 2020 a. Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. In DISC. 33:1--33:17.","journal-title":"In DISC."},{"key":"e_1_3_2_2_8_1","unstructured":"Keren Censor-Hillel Orr Fischer Franccois Le Gall Dean Leitersdorf and Rotem Oshman. 2022 a. Quantum Distributed Algorithms for Detection of Cliques. ITCS.  Keren Censor-Hillel Orr Fischer Franccois Le Gall Dean Leitersdorf and Rotem Oshman. 2022 a. Quantum Distributed Algorithms for Detection of Cliques. ITCS."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0270-2"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Keren Censor-Hillel Franccois Le Gall and Dean Leitersdorf. 2020 b. On Distributed Listing of Cliques. In PODC. 474--482.  Keren Censor-Hillel Franccois Le Gall and Dean Leitersdorf. 2020 b. On Distributed Listing of Cliques. In PODC. 474--482.","DOI":"10.1145\/3382734.3405742"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.11.006"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Keren Censor-Hillel Dean Leitersdorf and David Vulakh. 2022 b. Deterministic Near-Optimal Distributed Listing of Cliques. hrefhttps:\/\/arxiv.org\/abs\/2205.09245https:\/\/arxiv.org\/abs\/2205.09245.  Keren Censor-Hillel Dean Leitersdorf and David Vulakh. 2022 b. Deterministic Near-Optimal Distributed Listing of Cliques. hrefhttps:\/\/arxiv.org\/abs\/2205.09245https:\/\/arxiv.org\/abs\/2205.09245.","DOI":"10.1145\/3519270.3538434"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3446330"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Yi-Jun Chang Seth Pettie and Hengjie Zhang. 2019. Distributed Triangle Detection via Expander Decomposition. In SODA. 821--840.  Yi-Jun Chang Seth Pettie and Hengjie Zhang. 2019. Distributed Triangle Detection via Expander Decomposition. In SODA. 821--840.","DOI":"10.1137\/1.9781611975482.51"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Yi-Jun Chang and Thatchaphol Saranurak. 2019. Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. In PODC. 66--73.  Yi-Jun Chang and Thatchaphol Saranurak. 2019. Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. In PODC. 66--73.","DOI":"10.1145\/3293611.3331618"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Yi-Jun Chang and Thatchaphol Saranurak. 2020. Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. In FOCS. 377--388.  Yi-Jun Chang and Thatchaphol Saranurak. 2020. Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. In FOCS. 377--388.","DOI":"10.1109\/FOCS46700.2020.00043"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-019-00368-w"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Danny Dolev Christoph Lenzen and Shir Peled. 2012. \"Tri Tri Again\": Finding Triangles and Small Subgraphs in a Distributed Setting. In DISC. 195--209.  Danny Dolev Christoph Lenzen and Shir Peled. 2012. \"Tri Tri Again\": Finding Triangles and Small Subgraphs in a Distributed Setting. In DISC. 195--209.","DOI":"10.1007\/978-3-642-33651-5_14"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Andrew Drucker Fabian Kuhn and Rotem Oshman. 2014. On the power of the congested clique model. In PODC .  Andrew Drucker Fabian Kuhn and Rotem Oshman. 2014. On the power of the congested clique model. In PODC .","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_2_20_1","volume-title":"Sublinear-time distributed algorithms for detecting small cliques and even cycles. Distributed Computing","author":"Eden Talya","year":"2021","unstructured":"Talya Eden , Nimrod Fiat , Orr Fischer , Fabian Kuhn , and Rotem Oshman . 2021. Sublinear-time distributed algorithms for detecting small cliques and even cycles. Distributed Computing ( 2021 ). Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, and Rotem Oshman. 2021. Sublinear-time distributed algorithms for detecting small cliques and even cycles. Distributed Computing (2021)."},{"key":"e_1_3_2_2_21_1","first-page":"1","article-title":"Three Notes on Distributed Property Testing","volume":"15","author":"Even Guy","year":"2017","unstructured":"Guy Even , Orr Fischer , Pierre Fraigniaud , Tzlil Gonen , Reut Levi , Moti Medina , Pedro Montealegre , Dennis Olivetti , Rotem Oshman , Ivan Rapaport , and Ioan Todinca . 2017 . Three Notes on Distributed Property Testing . In DISC. 15 : 1 -- 15 :30. Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, and Ioan Todinca. 2017. Three Notes on Distributed Property Testing. In DISC. 15:1--15:30.","journal-title":"DISC."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Orr Fischer Tzlil Gonen Fabian Kuhn and Rotem Oshman. 2018. Possibilities and Impossibilities for Distributed Subgraph Detection. In SPAA. 153--162.  Orr Fischer Tzlil Gonen Fabian Kuhn and Rotem Oshman. 2018. Possibilities and Impossibilities for Distributed Subgraph Detection. In SPAA. 153--162.","DOI":"10.1145\/3210377.3210401"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3322811"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Pierre Fraigniaud Ivan Rapaport Ville Salo and Ioan Todinca. 2016. Distributed Testing of Excluded Subgraphs. In Distributed Computing. 342--356.  Pierre Fraigniaud Ivan Rapaport Ville Salo and Ioan Todinca. 2016. Distributed Testing of Excluded Subgraphs. In Distributed Computing. 342--356.","DOI":"10.1007\/978-3-662-53426-7_25"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghaffari Fabian Kuhn and Hsin-Hao Su. 2017. Distributed MST and Routing in Almost Mixing Time. In PODC. 131--140.  Mohsen Ghaffari Fabian Kuhn and Hsin-Hao Su. 2017. Distributed MST and Routing in Almost Mixing Time. In PODC. 131--140.","DOI":"10.1145\/3087801.3087827"},{"key":"e_1_3_2_2_26_1","first-page":"1","article-title":"New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms","volume":"31","author":"Ghaffari Mohsen","year":"2018","unstructured":"Mohsen Ghaffari and Jason Li . 2018 . New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms . In DISC. 31 : 1 -- 31 :16. Mohsen Ghaffari and Jason Li. 2018. New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. In DISC. 31:1--31:16.","journal-title":"DISC."},{"key":"e_1_3_2_2_27_1","first-page":"1","article-title":"Lower Bounds for Subgraph Detection in the CONGEST Model","volume":"6","author":"Gonen Tzlil","year":"2018","unstructured":"Tzlil Gonen and Rotem Oshman . 2018 . Lower Bounds for Subgraph Detection in the CONGEST Model . In OPODIS. 6 : 1 -- 6 :16. Tzlil Gonen and Rotem Oshman. 2018. Lower Bounds for Subgraph Detection in the CONGEST Model. In OPODIS. 6:1--6:16.","journal-title":"OPODIS."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.37236\/6862"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1326040"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Taisuke Izumi and Franccois Le Gall. 2017. Triangle Finding and Listing in CONGEST Networks. In PODC. 381--389.  Taisuke Izumi and Franccois Le Gall. 2017. Triangle Finding and Listing in CONGEST Networks. In PODC. 381--389.","DOI":"10.1145\/3087801.3087811"},{"key":"e_1_3_2_2_31_1","volume-title":"Franccois Le Gall, and Fr\u00e9d\u00e9ric Magniez","author":"Izumi Taisuke","year":"2020","unstructured":"Taisuke Izumi , Franccois Le Gall, and Fr\u00e9d\u00e9ric Magniez . 2020 . Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. STACS. Taisuke Izumi, Franccois Le Gall, and Fr\u00e9d\u00e9ric Magniez. 2020. Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. STACS."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218077"},{"key":"e_1_3_2_2_33_1","first-page":"1","article-title":"Deterministic Subgraph Detection in Broadcast CONGEST","volume":"4","author":"Korhonen Janne H.","year":"2018","unstructured":"Janne H. Korhonen and Joel Rybicki . 2018 . Deterministic Subgraph Detection in Broadcast CONGEST . In OPODIS. 4 : 1 -- 4 :16. Janne H. Korhonen and Joel Rybicki. 2018. Deterministic Subgraph Detection in Broadcast CONGEST. In OPODIS. 4:1--4:16.","journal-title":"OPODIS."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90061-4"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781933019604"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460900"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Seth Pettie and Hsin-Hao Su. 2013. Fast Distributed Coloring Algorithms for Triangle-Free Graphs. In ICALP. 681--693.  Seth Pettie and Hsin-Hao Su. 2013. Fast Distributed Coloring Algorithms for Triangle-Free Graphs. In ICALP. 681--693.","DOI":"10.1007\/978-3-642-39212-2_59"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","location":"Salerno Italy","acronym":"PODC '22","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538434","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:20Z","timestamp":1750191140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":37,"alternative-id":["10.1145\/3519270.3538434","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538434","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}