{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:47:25Z","timestamp":1770277645207,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Singapore MOE Tier 2 grant","award":["MOE2018-T2-1-160"],"award-info":[{"award-number":["MOE2018-T2-1-160"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400240","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"531-533","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["How Fast Can You Update Your MST?"],"prefix":"10.1145","author":[{"given":"Seth","family":"Gilbert","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Lawrence","family":"Li Er Lu","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Parallel Batch-Dynamic Graph Connectivity. CoRRabs\/1903.08794","author":"Acar Umut A.","year":"2019","unstructured":"Umut A. Acar , Daniel Anderson , Guy E. Blelloch , and Laxman Dhulipala . 2019. Parallel Batch-Dynamic Graph Connectivity. CoRRabs\/1903.08794 ( 2019 ). arXiv:1903.08794 http:\/\/arxiv.org\/abs\/1903.08794 Umut A. Acar, Daniel Anderson, Guy E. Blelloch, and Laxman Dhulipala. 2019. Parallel Batch-Dynamic Graph Connectivity. CoRRabs\/1903.08794 (2019). arXiv:1903.08794 http:\/\/arxiv.org\/abs\/1903.08794"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213560"},{"key":"e_1_3_2_1_3_1","volume-title":"Kristian De Lichtenberg, and Mikkel Thorup","author":"Alstrup Stephen","year":"2005","unstructured":"Stephen Alstrup , Jacob Holm , Kristian De Lichtenberg, and Mikkel Thorup . 2005 . Maintaining Information in Fully Dynamic Trees with Top Trees. ACM Trans. Algorithms 1, 2 (Oct. 2005), 243--264. https:\/\/doi.org\/10.1145\/1103963.1103966 10.1145\/1103963.1103966 Stephen Alstrup, Jacob Holm, Kristian De Lichtenberg, and Mikkel Thorup. 2005. Maintaining Information in Fully Dynamic Trees with Top Trees. ACM Trans. Algorithms1, 2 (Oct. 2005), 243--264. https:\/\/doi.org\/10.1145\/1103963.1103966"},{"key":"e_1_3_2_1_4_1","volume-title":"Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model. (02","author":"Anderson Daniel","year":"2020","unstructured":"Daniel Anderson , Guy Blelloch , and Kanat Tangwongsan . 2020. Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model. (02 2020 ). Daniel Anderson, Guy Blelloch, and Kanat Tangwongsan. 2020. Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model. (02 2020)."},{"key":"e_1_3_2_1_5_1","unstructured":"Laxman Dhulipala David Durfee Janardhan Kulkarni Richard Peng Saurabh Sawlani and Xiaorui Sun. [n.d.]. Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. 1300--1319. https:\/\/doi.org\/10.1137\/1.9781611975994.79arXiv:https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611975994.79    10.1137\/1.9781611975994.79arXiv:https:\nLaxman Dhulipala David Durfee Janardhan Kulkarni Richard Peng Saurabh Sawlani and Xiaorui Sun. [n.d.]. Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. 1300--1319. https:\/\/doi.org\/10.1137\/1.9781611975994.79arXiv:https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611975994.79"},{"key":"e_1_3_2_1_6_1","unstructured":"Mohsen Ghaffari and Davin Choo. [n.d.]. Massively Parallel Algorithms. https:\/\/people.inf.ethz.ch\/gmohsen\/MPA19\/Notes\/MPA.pdf  Mohsen Ghaffari and Davin Choo. [n.d.]. Massively Parallel Algorithms. https:\/\/people.inf.ethz.ch\/gmohsen\/MPA19\/Notes\/MPA.pdf"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00097"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933103"},{"key":"e_1_3_2_1_9_1","volume-title":"Algorithms and Computation, Takao Asano, Shin-ichi Nakano","author":"Goodrich Michael T.","unstructured":"Michael T. Goodrich , Nodari Sitchinava , and Qin Zhang . 2011. Sorting, Searching,and Simulation in the MapReduce Framework . In Algorithms and Computation, Takao Asano, Shin-ichi Nakano , Yoshio Okamoto, and Osamu Watanabe (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 374--383. Michael T. Goodrich, Nodari Sitchinava, and Qin Zhang. 2011. Sorting, Searching,and Simulation in the MapReduce Framework. In Algorithms and Computation, Takao Asano, Shin-ichi Nakano, Yoshio Okamoto, and Osamu Watanabe (Eds.).Springer Berlin Heidelberg, Berlin, Heidelberg, 374--383."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767434"},{"key":"e_1_3_2_1_11_1","volume-title":"Dynamic Algorithms for the Massively Parallel Computation Model. CoRRabs\/1905.09175","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. CoRRabs\/1905.09175 ( 2019 ). arXiv:1905.09175 http:\/\/arxiv.org\/abs\/1905.09175 Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, and Nikos Parotsidis. 2019. Dynamic Algorithms for the Massively Parallel Computation Model. CoRRabs\/1905.09175 (2019). arXiv:1905.09175 http:\/\/arxiv.org\/abs\/1905.09175"},{"key":"e_1_3_2_1_12_1","volume-title":"MST in O(1) Rounds of the Congested Clique. CoRRabs\/1707.08484","author":"Jurdzinski Tomasz","year":"2017","unstructured":"Tomasz Jurdzinski and Krzysztof Nowicki . 2017. MST in O(1) Rounds of the Congested Clique. CoRRabs\/1707.08484 ( 2017 ). arXiv:1707.08484 http:\/\/arxiv.org\/abs\/1707.08484 Tomasz Jurdzinski and Krzysztof Nowicki. 2017. MST in O(1) Rounds of the Congested Clique. CoRRabs\/1707.08484 (2017). arXiv:1707.08484 http:\/\/arxiv.org\/abs\/1707.08484"},{"key":"#cr-split#-e_1_3_2_1_13_1.1","doi-asserted-by":"crossref","unstructured":"Howard Karloff Siddharth Suri and Sergei Vassilvitskii. 2010. A Model of Computation for MapReduce. 938--948. https:\/\/doi.org\/10.1137\/1.9781611973075.76 10.1137\/1.9781611973075.76","DOI":"10.1137\/1.9781611973075.76"},{"key":"#cr-split#-e_1_3_2_1_13_1.2","doi-asserted-by":"crossref","unstructured":"Howard Karloff Siddharth Suri and Sergei Vassilvitskii. 2010. A Model of Computation for MapReduce. 938--948. https:\/\/doi.org\/10.1137\/1.9781611973075.76","DOI":"10.1137\/1.9781611973075.76"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722157"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2501983"},{"key":"e_1_3_2_1_17_1","volume-title":"Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. ArXivabs\/2002.07800","author":"Nowicki Krzysztof","year":"2020","unstructured":"Krzysztof Nowicki and Krzysztof Onak . 2020. Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. ArXivabs\/2002.07800 ( 2020 ). Krzysztof Nowicki and Krzysztof Onak. 2020. Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. ArXivabs\/2002.07800 (2020)."},{"key":"e_1_3_2_1_18_1","volume-title":"Almost Optimal Distributed Algorithms for Large-Scale Graph Problems. CoRRabs\/1503.02353","author":"Pandurangan Gopal","year":"2015","unstructured":"Gopal Pandurangan , Peter Robinson , and Michele Scquizzato . 2015. Almost Optimal Distributed Algorithms for Large-Scale Graph Problems. CoRRabs\/1503.02353 ( 2015 ). arXiv:1503.02353 http:\/\/arxiv.org\/abs\/1503.02353 Gopal Pandurangan, Peter Robinson, and Michele Scquizzato. 2015. Almost Optimal Distributed Algorithms for Large-Scale Graph Problems. CoRRabs\/1503.02353 (2015). arXiv:1503.02353 http:\/\/arxiv.org\/abs\/1503.02353"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209689"},{"key":"e_1_3_2_1_20_1","unstructured":"Thomas Tseng Laxman Dhulipala and Guy Blelloch. [n.d.]. Batch-Parallel Euler Tour Trees.92--106.https:\/\/doi.org\/10.1137\/1.9781611975499.8 arXiv: https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611975499.8    10.1137\/1.9781611975499.8\nThomas Tseng Laxman Dhulipala and Guy Blelloch. [n.d.]. Batch-Parallel Euler Tour Trees.92--106.https:\/\/doi.org\/10.1137\/1.9781611975499.8 arXiv: https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611975499.8"}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","location":"Virtual Event USA","acronym":"SPAA '20","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"]},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400240","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:35Z","timestamp":1750202015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":21,"alternative-id":["10.1145\/3350755.3400240","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400240","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}