{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:46Z","timestamp":1750220326570,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The National Science Foundation","award":["1546108,1822738,2114269,2114269"],"award-info":[{"award-number":["1546108,1822738,2114269,2114269"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538576","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"23-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive Massively Parallel Algorithms for Cut Problems"],"prefix":"10.1145","author":[{"given":"MohammadTaghi","family":"Hajiaghayi","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Knittel","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Olkowski","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamed","family":"Saleh","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Alexandr Andoni Aleksandar Nikolov Krzysztof Onak and Grigory Yaroslavtsev. 2014. Parallel algorithms for geometric graph problems. In STOC. 574--583.  Alexandr Andoni Aleksandar Nikolov Krzysztof Onak and Grigory Yaroslavtsev. 2014. Parallel algorithms for geometric graph problems. In STOC. 574--583.","DOI":"10.1145\/2591796.2591805"},{"key":"e_1_3_2_1_2_1","volume-title":"Mirrokni","author":"Behnezhad Soheil","year":"2019","unstructured":"Soheil Behnezhad , Laxman Dhulipala , Hossein Esfandiari , Jakub Lacki , and Vahab S . Mirrokni . 2019 . Near-Optimal Massively Parallel Graph Connectivity. In FOCS. 1615--1636. Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, and Vahab S. Mirrokni. 2019. Near-Optimal Massively Parallel Graph Connectivity. In FOCS. 1615--1636."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323208"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3424573.3424579"},{"key":"e_1_3_2_1_5_1","volume-title":"Harris","author":"Behnezhad Soheil","year":"2019","unstructured":"Soheil Behnezhad , MohammadTaghi Hajiaghayi , and David G . Harris . 2019 . Exponentially Faster Massively Parallel Maximal Matching. In FOCS. 1637--1649. Soheil Behnezhad, MohammadTaghi Hajiaghayi, and David G. Harris. 2019. Exponentially Faster Massively Parallel Maximal Matching. In FOCS. 1637--1649."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Craig Chambers Ashish Raniwala Frances Perry Stephen Adams Robert R. Henry Robert Bradshaw and Nathan Weizenbaum. 2010. FlumeJava: easy efficient data-parallel pipelines. In ACM SIGPLAN Benjamin G. Zorn and Alexander Aiken (Eds.). 363--375.  Craig Chambers Ashish Raniwala Frances Perry Stephen Adams Robert R. Henry Robert Bradshaw and Nathan Weizenbaum. 2010. FlumeJava: easy efficient data-parallel pipelines. In ACM SIGPLAN Benjamin G. Zorn and Alexander Aiken (Eds.). 363--375.","DOI":"10.1145\/1809028.1806638"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_8_1","first-page":"3","article-title":"Rdma reads: To use or not to use","volume":"40","author":"Dragojevic Aleksandar","year":"2017","unstructured":"Aleksandar Dragojevic , Dushyanth Narayanan , and Miguel Castro . 2017 . Rdma reads: To use or not to use ? IEEE Data Eng. Bull. 40 , 1 (2017), 3 -- 14 . Aleksandar Dragojevic, Dushyanth Narayanan, and Miguel Castro. 2017. Rdma reads: To use or not to use? IEEE Data Eng. Bull. 40, 1 (2017), 3--14.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_3_2_1_9_1","unstructured":"Aleksandar Dragojevic Dushyanth Narayanan Miguel Castro and Orion Hodson. 2014. FaRM: Fast remote memory. In {USENIX} ({NSDI}). 401--414.  Aleksandar Dragojevic Dushyanth Narayanan Miguel Castro and Orion Hodson. 2014. FaRM: Fast remote memory. In {USENIX} ({NSDI}). 401--414."},{"key":"e_1_3_2_1_10_1","unstructured":"Apache Software Foundation. [n.d.]. Hadoop. https:\/\/hadoop.apache.org\/.  Apache Software Foundation. [n.d.]. Hadoop. https:\/\/hadoop.apache.org\/."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405737"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/313559.313605"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234534"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Howard J. Karloff Siddharth Suri and Sergei Vassilvitskii. 2010. A Model of Computation for MapReduce. In SODA. 938--948.  Howard J. 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_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792251730"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802464"},{"key":"e_1_3_2_1_20_1","unstructured":"Grigory Yaroslavtsev and Adithya Vadapalli. 2018. Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under Distances. In ICML. 5596--5605.  Grigory Yaroslavtsev and Adithya Vadapalli. 2018. Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under Distances. In ICML. 5596--5605."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934664"}],"event":{"name":"SPAA '22: 34th 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":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538576","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538576","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538576","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:08Z","timestamp":1750191128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538576"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":21,"alternative-id":["10.1145\/3490148.3538576","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538576","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}