{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:46Z","timestamp":1777954606632,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","funder":[{"name":"German Research Foundation (DFG)","award":["470029389, SPP-2378"],"award-info":[{"award-number":["470029389, SPP-2378"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743327","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"240-254","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model"],"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"Technical University Berlin, Berlin, Germany"}]},{"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"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Miguel Castro, Srikanth Kandula, Saeed Maleki, and Luke Marshall.","author":"Arzani Behnaz","year":"2023","unstructured":"Behnaz Arzani, Siva Kesava Reddy Kakarla, Miguel Castro, Srikanth Kandula, Saeed Maleki, and Luke Marshall. 2023. Rethinking Machine Learning Collective Communication as a Multi-Commodity Flow Problem. arXiv preprint arXiv:2305.13479 (2023)."},{"key":"e_1_3_2_2_2_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_2_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_2_4_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_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59647-1_18"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_18"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.21203\/rs.3.rs-1998221\/v1"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92702-8_14"},{"key":"e_1_3_2_2_9_1","volume-title":"41st International Symposium on Theoretical Aspects of Computer Science (STACS).","author":"Bienkowski Marcin","year":"2024","unstructured":"Marcin Bienkowski and Stefan Schmid. 2024. A Subquadratic Bound for Online Bisection. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS)."},{"key":"e_1_3_2_2_10_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_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.4"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3491050"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.166"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3309697.3331503"},{"key":"e_1_3_2_2_15_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_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2378956.2378964"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488824"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538563"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591097"},{"key":"e_1_3_2_2_21_1","volume-title":"30th Annual European Symposium on Algorithms (ESA","author":"Rajaraman Rajmohan","year":"2022","unstructured":"Rajmohan Rajaraman. 2022. Improved bounds for online balanced graph re-partitioning. In 30th Annual European Symposium on Algorithms (ESA 2022)."},{"key":"e_1_3_2_2_22_1","volume-title":"Competitive Capacitated Online Recoloring. arXiv preprint arXiv:2408.05370","author":"Rajaraman Rajmohan","year":"2024","unstructured":"Rajmohan Rajaraman and Omer Wasim. 2024. Competitive Capacitated Online Recoloring. arXiv preprint arXiv:2408.05370 (2024)."}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","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 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:18:49Z","timestamp":1777922329000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":22,"alternative-id":["10.1145\/3694906.3743327","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743327","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}