乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T03:53:01Z","timestamp":1725767581725},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3662158.3662770","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:38:06Z","timestamp":1717598286000},"page":"496-507","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Streaming Graph Algorithms in the Massively Parallel Computation Model"],"prefix":"10.1145","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-7743-438X","authenticated-orcid":false,"given":"Artur","family":"Czumaj","sequence":"first","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0540-0292","authenticated-orcid":false,"given":"Gopinath","family":"Mishra","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5857-9778","authenticated-orcid":false,"given":"Anish","family":"Mukherjee","sequence":"additional","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"Umut A. Acar Daniel Anderson Guy E. Blelloch and Laxman Dhulipala. 2019. Parallel Batch-Dynamic Graph Connectivity. In SPAA. 381--392. 10.1145\/3323165.3323196","DOI":"10.1145\/3323165.3323196"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2020.2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154855"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"Kook Jin Ahn Sudipto Guha and Andrew McGregor. 2012. Analyzing Graph Structure via Linear Measurements. In SODA. 459--467. 10.1137\/1.9781611973099.40","DOI":"10.1137\/1.9781611973099.40"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"Daniel Anderson Guy E. Blelloch and Kanat Tangwongsan. 2020. Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model. In SPAA. 51--61. 10.1145\/3350755.3400241","DOI":"10.1145\/3350755.3400241"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Alexandr Andoni Aleksandar Nikolov Krzysztof Onak and Grigory Yaroslavtsev. 2014. Parallel Algorithms for Geometric Graph Problems. In STOC. 574--583. 10.1145\/2591796.2591805","DOI":"10.1145\/2591796.2591805"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Alexandr Andoni Zhao Song Clifford Stein Zhengyu Wang and Peilin Zhong. 2018. Parallel Graph Connectivity in Log Diameter Rounds. In FOCS. 674--685. 10.1109\/FOCS.2018.00070","DOI":"10.1109\/FOCS.2018.00070"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.98"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"Sepehr Assadi Sanjeev Khanna and Yang Li. 2017. On Estimating Maximum Matching Size in Graph Streams. In SODA. 1723--1742. 10.1137\/1.9781611974782.113","DOI":"10.1137\/1.9781611974782.113"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1095482"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Sepehr Assadi Sanjeev Khanna Yang Li and Grigory Yaroslavtsev. 2016. Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model. In SODA. 1345--1364. 10.1137\/1.9781611974331.ch93","DOI":"10.1137\/1.9781611974331.ch93"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3125644"},{"key":"e_1_3_2_1_13_1","volume-title":"Brief Announcement: Semi-MapReduce Meets Congested Clique. CoRR abs\/1802.10297","author":"Behnezhad Soheil","year":"2018","unstructured":"Soheil Behnezhad, Mahsa Derakhshan, and MohammadTaghi Hajiaghayi. 2018. Brief Announcement: Semi-MapReduce Meets Congested Clique. CoRR abs\/1802.10297 (2018)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00095"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00096"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498334"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3131677"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933083"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","unstructured":"Rajesh Chitnis Graham Cormode Hossein Esfandiari MohammadTaghi Hajiaghayi Andrew McGregor Morteza Monemizadeh and Sofya Vorotnikova. 2016. Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. In SODA. 1326--1344. 10.1137\/1.9781611974331.ch92","DOI":"10.1137\/1.9781611974331.ch92"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297715"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108769938"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","unstructured":"Artur Czumaj Peter Davies and Merav Parter. 2021. Component Stability in Low-Space Massively Parallel Computation. In PODC. 481--491. 10.1145\/3465084.3467903","DOI":"10.1145\/3465084.3467903"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","unstructured":"Artur Czumaj Jakub Lacki Aleksander Madry Slobodan Mitrovic Krzysztof Onak and Piotr Sankowski. 2018. Round Compression for Parallel Matching Algorithms. In STOC. 471--484. 10.1145\/3188745.3188764","DOI":"10.1145\/3188745.3188764"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.120"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629175.1629198"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","unstructured":"Laxman Dhulipala David Durfee Janardhan Kulkarni Richard Peng Saurabh Sawlani and Xiaorui Sun. 2020. Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. In SODA. 1300--1319. 10.1137\/1.9781611975994.79","DOI":"10.1137\/1.9781611975994.79"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","unstructured":"Laxman Dhulipala Quanquan C. Liu Julian Shun and Shangdi Yu. 2021. Parallel Batch-Dynamic k-Clique Counting. In APOCS. 129--143. 10.1137\/1.9781611976489.10","DOI":"10.1137\/1.9781611976489.10"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.013"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","unstructured":"Mohsen Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrovic and Ronitt Rubinfeld. 2018. Improved Massively Parallel Computation Algorithms for MIS Matching and Vertex Cover. In PODC. 129--138. 10.1145\/3212734.3212743","DOI":"10.1145\/3212734.3212743"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","unstructured":"Mohsen Ghaffari and Jara Uitto. 2019. Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. In SODA. 1636--1653. 10.1137\/1.9781611975482.99","DOI":"10.1137\/1.9781611975482.99"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","unstructured":"Seth Gilbert and Lawrence Er Lu Li. 2020. How Fast Can You Update Your MST?. In SPAA. 531--533. 10.1145\/3350755.3400240","DOI":"10.1145\/3350755.3400240"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3555806"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.029"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272998.1273005"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","unstructured":"Giuseppe F. Italiano Silvio Lattanzi Vahab S. Mirrokni and Nikos Parotsidis. 2019. Dynamic Algorithms for the Massively Parallel Computation Model. In SPAA. 49--58. 10.1145\/3323165.3323202","DOI":"10.1145\/3323165.3323202"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","unstructured":"Howard J. Karloff Siddharth Suri and Sergei Vassilvitskii. 2010. A Model of Computation for MapReduce. In SODA. 938--948. 10.1137\/1.9781611973075.76","DOI":"10.1137\/1.9781611973075.76"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","unstructured":"Christian Konrad. 2015. Maximum Matching in Turnstile Streams. In ESA. 840--852. 10.1007\/978-3-662-48350-3_70","DOI":"10.1007\/978-3-662-48350-3_70"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","unstructured":"Pradeep Kumar and H. Howie Huang. 2016. G-Store: High-Performance Graph Store for Trillion-Edge Processing. In SC. 830--841. 10.1109\/SC.2016.70","DOI":"10.1109\/SC.2016.70"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","unstructured":"Jakub Lacki Slobodan Mitrovic Krzysztof Onak and Piotr Sankowski. 2020. Walking Randomly Massively and Efficiently. In STOC. 364--377. 10.1145\/3357713.3384303","DOI":"10.1145\/3357713.3384303"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","unstructured":"Quanquan C. Liu Jessica Shi Shangdi Yu Laxman Dhulipala and Julian Shun. 2022. Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems. In SPAA. 191--204. 10.1145\/3490148.3538569","DOI":"10.1145\/3490148.3538569"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627694"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","unstructured":"Jelani Nelson and Huacheng Yu. 2019. Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation. In SODA. 1844--1860. 10.1137\/1.9781611975482.111","DOI":"10.1137\/1.9781611975482.111"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","unstructured":"Krzysztof Nowicki and Krzysztof Onak. 2021. Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. In SODA. 2939--2958. 10.1137\/1.9781611976465.175","DOI":"10.1137\/1.9781611976465.175"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3232536"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815408"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975499.8"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","unstructured":"Tom Tseng Laxman Dhulipala and Julian Shun. 2022. Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering. In SPAA. 233--245. 10.1145\/3490148.3538584","DOI":"10.1145\/3490148.3538584"},{"key":"e_1_3_2_1_53_1","volume-title":"Hadoop: The Definitive Guide: Storage and Analysis at Internet Scale (4 ed.). O'Reilly","author":"White Tom","year":"2015","unstructured":"Tom White. 2015. Hadoop: The Definitive Guide: Storage and Analysis at Internet Scale (4 ed.). O'Reilly. http:\/\/www.oreilly.de\/catalog\/9781491901632\/index.html"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","unstructured":"Ming Wu Fan Yang Jilong Xue Wencong Xiao Youshan Miao Lan Wei Haoxiang Lin Yafei Dai and Lidong Zhou. 2015. GraM: scaling graph computation to the trillions. In SoCC. 408--421. 10.1145\/2806777.2806849","DOI":"10.1145\/2806777.2806849"},{"key":"e_1_3_2_1_55_1","volume-title":"Spark: Cluster Computing with Working Sets. In HotCloud. https:\/\/www.usenix.org\/conference\/hotcloud -cluster-computing-working-sets spark","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. In HotCloud. https:\/\/www.usenix.org\/conference\/hotcloud -cluster-computing-working-sets spark"}],"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":[],"deposited":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T15:23:12Z","timestamp":1717600992000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":55,"alternative-id":["10.1145\/3662158.3662770","10.1145\/3662158"],"URL":"https:\/\/doi.org\/10.1145\/3662158.3662770","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"}}]}}