{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T16:56:00Z","timestamp":1780073760169,"version":"3.54.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Federal Ministry of Education and Research (BMBF)","award":["16KISK020K"],"award-info":[{"award-number":["16KISK020K"]}]},{"name":"German Research Foundation (DFG)","award":["470029389"],"award-info":[{"award-number":["470029389"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,17]]},"DOI":"10.1145\/3558481.3591097","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"403-413","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8797-717X","authenticated-orcid":false,"given":"Harald","family":"R\u00e4cke","sequence":"first","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"Technical University of Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7021-7163","authenticated-orcid":false,"given":"Ruslan","family":"Zabrodin","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"SIAM J. Discrete Math (SIDMA).","volume-title":"Dynamic Balanced Graph Partitioning","author":"Avin Chen","unstructured":"Chen Avin, Marcin Bienkowski, Andreas Loukas, Maciej Pacut, and Stefan Schmid. 2019. Dynamic Balanced Graph Partitioning. In SIAM J. Discrete Math (SIDMA)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Chen Avin Louis Cohen Mahmoud Parham and Stefan Schmid. 2018. Competitive Clustering of Stochastic Communication Patterns on a Ring. In Journal of Computing.","DOI":"10.1007\/s00607-018-0666-x"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Chen Avin Louis Cohen Mahmoud Parham and Stefan Schmid. 2018. Competitive Clustering of Stochastic Communication Patterns on a Ring. In Journal of Computing.","DOI":"10.1007\/s00607-018-0666-x"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59647-1_18"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_18"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258667"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.008"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814617"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146588"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"S\u00e9bastien Bubeck Christian Coester and Yuval Rabani. 2022. The Randomized k-Server Conjecture is False! https:\/\/doi.org\/10.48550\/ARXIV.2211.05753","DOI":"10.48550\/ARXIV.2211.05753"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1237879"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-008-0070-9"},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"Fully-Dynamic Bin Packing with Little Repacking","volume":"51","author":"Feldkord Bj\u00f6rn","year":"2018","unstructured":"Bj\u00f6rn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, S\u00f6ren Riechers, and David Wajc. 2018. Fully-Dynamic Bin Packing with Little Repacking. In ICALP. 51:1--51:24.","journal-title":"ICALP."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376159"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3491050"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.166"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3309697.3331503"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7535"},{"key":"e_1_3_2_1_20_1","volume-title":"Algorithms Column 38: 2021 in Review. SIGACT News 52","author":"Hohne Felix","year":"2021","unstructured":"Felix Hohne, Soren Schmitt, and Rob van Stee. 2021. Algorithms Column 38: 2021 in Review. SIGACT News 52 (2021)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2378956.2378964"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488824"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538563"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Harald R\u00e4cke Stefan Schmid and Ruslan Zabrodin. 2023. Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands. arXiv:2304.10350 [cs.DS]","DOI":"10.1145\/3558481.3591097"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1090.0381"},{"key":"e_1_3_2_1_27_1","volume-title":"Horovod: fast and easy distributed deep learning in TensorFlow. CoRR abs\/1802.05799","author":"Sergeev Alexander","year":"2018","unstructured":"Alexander Sergeev and Mike Del Balso. 2018. Horovod: fast and easy distributed deep learning in TensorFlow. CoRR abs\/1802.05799 (2018). arXiv:1802.05799 http:\/\/arxiv.org\/abs\/1802.05799"},{"key":"e_1_3_2_1_28_1","unstructured":"Carl Yang. 2018. Tree-based Allreduce Communication on MXNet. (2018)."}],"event":{"name":"SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Orlando FL USA","acronym":"SPAA '23","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 35th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591097","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:06Z","timestamp":1750178826000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":28,"alternative-id":["10.1145\/3558481.3591097","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591097","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}