{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:15:25Z","timestamp":1755839725745,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["DMS-2023495","CCF-1740850","1839317","1908384","2245904"],"award-info":[{"award-number":["DMS-2023495","CCF-1740850","1839317","1908384","2245904"]}]},{"name":"Army Research Office Award","award":["W911NF1910294"],"award-info":[{"award-number":["W911NF1910294"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3662158.3662819","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:38:06Z","timestamp":1717598286000},"page":"519-522","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1230-2754","authenticated-orcid":false,"given":"Quanquan C.","family":"Liu","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2163-3555","authenticated-orcid":false,"given":"C.","family":"Seshadhri","sequence":"additional","affiliation":[{"name":"University of California, Santa Cruz, Santa Cruz, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1226"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0287-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505545"},{"key":"e_1_3_2_1_4_1","volume-title":"ITCS (LIPIcs","volume":"20","author":"Assadi Sepehr","year":"2019","unstructured":"Sepehr Assadi, Michael Kapralov, and Sanjeev Khanna. 2019. A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. In ITCS (LIPIcs, Vol. 124). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 6:1--6:20."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545464"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465224"},{"key":"e_1_3_2_1_7_1","volume-title":"34th Symposium on Theoretical Aspects of Computer Science.","author":"Bera Suman K","year":"2017","unstructured":"Suman K Bera and Amit Chakrabarti. 2017. Towards tighter space bounds for counting triangles and other substructures in graph streams. In 34th Symposium on Theoretical Aspects of Computer Science."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.APPROX\/RANDOM.2022.39"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087580"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.10"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1054389"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.89"},{"volume-title":"External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. In European Symposium on Algorithms. 664--676","author":"Michael","key":"e_1_3_2_1_15_1","unstructured":"Michael T. Goodrich and Pawe\u0142 Pszona. 2011. External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. In European Symposium on Algorithms. 664--676."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Sungjin Im Ravi Kumar Silvio Lattanzi Benjamin Moseley Sergei Vassilvitskii et al. 2023. Massively Parallel Computation: Algorithms and Applications. Foundations and Trends\u00ae in Optimization 5 4 (2023) 340--417.","DOI":"10.1561\/2400000025"},{"volume-title":"ACM SIGOPS operating systems review","author":"Isard Michael","key":"e_1_3_2_1_18_1","unstructured":"Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, and Dennis Fetterly. 2007. Dryad: distributed data-parallel programs from sequential building blocks. In ACM SIGOPS operating systems review, Vol. 41. ACM, 59--72."},{"volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Kane Daniel M","key":"e_1_3_2_1_19_1","unstructured":"Daniel M Kane, Kurt Mehlhorn, Thomas Sauerwald, and He Sun. 2012. Counting arbitrary subgraphs in data streams. In International Colloquium on Automata, Languages, and Programming. Springer, 598--609."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Howard Karloff Siddharth Suri and Sergei Vassilvitskii. 2010. A model of computation for MapReduce. In SODA. 938--948.","DOI":"10.1137\/1.9781611973075.76"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/13090729X"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794368"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902283"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662017"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1077-6"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"e_1_3_2_1_29_1","volume-title":"Hadoop: The definitive guide. \" O'Reilly Media","author":"White Tom","year":"2012","unstructured":"Tom White. 2012. Hadoop: The definitive guide. \" O'Reilly Media, Inc.\"."},{"key":"e_1_3_2_1_30_1","first-page":"10","article-title":"Spark: Cluster computing with working sets","volume":"10","author":"Zaharia Matei","year":"2010","unstructured":"Matei Zaharia, Mosharaf Chowdhury, Michael J Franklin, Scott Shenker, and Ion Stoica. 2010. Spark: Cluster computing with working sets. HotCloud 10, 10-10 (2010), 95.","journal-title":"HotCloud"}],"event":{"name":"PODC '24: 43rd ACM Symposium on Principles of Distributed Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Nantes France","acronym":"PODC '24"},"container-title":["Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662819","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:41Z","timestamp":1750290221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":30,"alternative-id":["10.1145\/3662158.3662819","10.1145\/3662158"],"URL":"https:\/\/doi.org\/10.1145\/3662158.3662819","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}