{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:11Z","timestamp":1773481811864,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001742","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1278\/16"],"award-info":[{"award-number":["1278\/16"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["683064"],"award-info":[{"award-number":["683064"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210403","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"333-341","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest"],"prefix":"10.1145","author":[{"given":"Tsvi","family":"Kopelowitz","sequence":"first","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}]},{"given":"Yair","family":"Rosenmutter","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.44"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Sajal K. Das and Paolo Ferragina. An o(n) work EREW parallel algorithm for updating MST. In 2'nd Annual European Symposium on Algorithms (ESA) pages 331--342 1994.   Sajal K. Das and Paolo Ferragina. An o(n) work EREW parallel algorithm for updating MST. In 2'nd Annual European Symposium on Algorithms (ESA) pages 331--342 1994.","DOI":"10.1007\/BFb0049420"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267818"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/265910.265914"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645605.663229"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214055"},{"key":"e_1_3_2_1_7_1","unstructured":"D. Gibb B. M. Kapron V. King and N. Thorn. Dynamic graph connectivity with improved worst case update time and sublinear space. CoRR abs\/1509.06464 2015.  D. Gibb B. M. Kapron V. King and N. Thorn. Dynamic graph connectivity with improved worst case update time and sublinear space. CoRR abs\/1509.06464 2015."},{"key":"e_1_3_2_1_8_1","first-page":"594","volume-title":"24th International Colloquium, (ICALP)","author":"Henzinger Monika Rauch","year":"1997"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502095"},{"key":"e_1_3_2_1_10_1","first-page":"742","volume-title":"Proceedings","author":"Holm Jacob","year":"2015"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039718"},{"key":"e_1_3_2_1_12_1","volume-title":"Addison-Wesley","author":"J\u00b4aJ\u00b4a Joseph","year":"1992"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627898"},{"key":"e_1_3_2_1_14_1","first-page":"1","volume-title":"24th Annual European Symposium on Algorithms, (ESA)","author":"Kejlberg-Rasmussen Casper","year":"2016"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210403"},{"key":"e_1_3_2_1_16_1","volume-title":"Unpublished Manuscripts","author":"Liang W.","year":"1994"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055447"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.92"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447256"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645900.672593"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-0045-2"},{"key":"e_1_3_2_1_23_1","unstructured":"Zhengyu Wang. An improved randomized data structure for dynamic graph connectivity. CoRR abs\/1510.04590 2015.  Zhengyu Wang. An improved randomized data structure for dynamic graph connectivity. CoRR abs\/1510.04590 2015."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627943"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055415"}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Vienna Austria","acronym":"SPAA '18","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 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210403","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:20Z","timestamp":1750210760000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":25,"alternative-id":["10.1145\/3210377.3210403","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210403","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}