{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:49:59Z","timestamp":1773481799600,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055415","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"1130-1143","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["Fully-dynamic minimum spanning forest with improved worst-case update time"],"prefix":"10.1145","author":[{"given":"Christian","family":"Wulff-Nilsen","sequence":"first","affiliation":[{"name":"University of Copenhagen, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103963.1103966"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/265910.265914"},{"key":"e_1_3_2_2_3_1","unstructured":"See also  FOCS\u2019 92.  See also FOCS\u2019 92."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214055"},{"key":"e_1_3_2_2_5_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_2_6_1","series-title":"Lecture Notes in Computer Science","first-page":"604","volume-title":"Proc. ICALP","author":"Henzinger M. R."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/320211.320215"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502095"},{"key":"e_1_3_2_2_9_1","volume-title":"Faster Fully-Dynamic Minimum Spanning Forest. ESA 2015:  742\u2013753","author":"Holm J."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627898"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195422"},{"key":"e_1_3_2_2_12_1","volume-title":"Faster Worst Case Deterministic Dynamic Connectivity. ESA 2016:  53:1\u201353:15","author":"Kejlberg-Rasmussen C."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"D. Nanongkai and T. Saranurak. Dynamic Spanning Forest with Worst-Case Update Time: Adaptive Las Vegas and O (n 1\/2\u2212 )-Time. CoRR abs\/ 1611.03745 2016. To appear at STOC\u201917.  D. Nanongkai and T. Saranurak. Dynamic Spanning Forest with Worst-Case Update Time: Adaptive Las Vegas and O (n 1\/2\u2212 )-Time. CoRR abs\/ 1611.03745 2016. To appear at STOC\u201917.","DOI":"10.1145\/3055399.3055447"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447256"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055415"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055415","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:27Z","timestamp":1750220607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":16,"alternative-id":["10.1145\/3055399.3055415","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055415","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}