{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:09Z","timestamp":1750220529257,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["16582"],"award-info":[{"award-number":["16582"]}],"id":[{"id":"10.13039\/100008398","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451107","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1262-1275","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Load balancing with dynamic set of balls and bins"],"prefix":"10.1145","author":[{"given":"Anders","family":"Aamand","sequence":"first","affiliation":[{"name":"University of Copenhagen, Denmark"}]},{"given":"Jakob B\u00e6k Tejs","family":"Knudsen","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Denmark"}]},{"given":"Mikkel","family":"Thorup","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Jakob B\ufffdk Tejs Knudsen, and Mikkel Thorup","author":"Aamand Anders","year":"2021","unstructured":"Anders Aamand, Noga Alon, Jakob B\ufffdk Tejs Knudsen, and Mikkel Thorup. 2021. On Sums of Monotone Random Integer Variables."},{"key":"e_1_3_2_1_2_1","volume-title":"Jakob B\ufffdk Tejs Knudsen, and Mikkel Thorup","author":"Aamand Anders","year":"2021","unstructured":"Anders Aamand, Jakob B\ufffdk Tejs Knudsen, and Mikkel Thorup. 2021. Load Balancing with Dynamic Set of Balls and Bins."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.2748\/tmj\/1178243286"},{"volume-title":"Proc. 48th IEEE Symposium on Foundations of Computer Science (FOCS). Pages 272\u2013282","author":"Blelloch G. E.","key":"e_1_3_2_1_5_1","unstructured":"G. E. Blelloch and D. Golovin. 2007. Strongly History-Independent Hashing with Applications. In Proc. 48th IEEE Symposium on Foundations of Computer Science (FOCS). Pages 272\u2013282."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/341800.341815"},{"key":"e_1_3_2_1_7_1","first-page":"8","article-title":"SCRIBE: A large-scale and decentralized application-level multicast infrastructure. Selected Areas in Communications","volume":"20","author":"Castro Miguel","year":"2002","unstructured":"Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, and Antony IT Rowstron. 2002. SCRIBE: A large-scale and decentralized application-level multicast infrastructure. Selected Areas in Communications, IEEE Journal on, 20, 8, 2002. Pages 1489\u20131499.","journal-title":"IEEE Journal on"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.83"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073872"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2013.12.009"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-3005-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1246-6"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1073990"},{"volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"Knuth Donald E.","key":"e_1_3_2_1_15_1","unstructured":"Donald E. Knuth. 1973. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/42404.42410"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011797"},{"key":"e_1_3_2_1_18_1","volume-title":"Google Research Blog","author":"Mirrokni Vahab","year":"2017","unstructured":"Vahab Mirrokni and Morteza Zadimoghaddam. 2017. Consistent Hashing with Bounded Loads. Google Research Blog, April 3, 2017. https:\/\/research.googleblog.com\/2017\/04\/consistent-hashing-with-bounded-loads.html"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.39"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8834-8"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Sylvia Ratnasamy Paul Francis Mark Handley Richard Karp and Scott Shenker. 2001. A scalable content-addressable network. 31 ACM.","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_22_1","first-page":"2016","article-title":"Improving load balancing with a new consistent-hashing algorithm","volume":"19","author":"Rodland Andrew","year":"2016","unstructured":"Andrew Rodland. 2016. Improving load balancing with a new consistent-hashing algorithm. Vimeo Engineering Blog, December 19, 2016. https:\/\/medium.com\/vimeo-engineering-blog\/improving-load-balancing-with-a-new-consistent-hashing-algorithm-9f1bd75709ed","journal-title":"Vimeo Engineering Blog"},{"key":"e_1_3_2_1_23_1","volume-title":"Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware","author":"Rowstron Antony","year":"2001","unstructured":"Antony Rowstron and Peter Druschel. 2001. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware 2001. Pages 329\u2013350."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/964723.383071"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.663936"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Italy","acronym":"STOC '21"},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451107","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":26,"alternative-id":["10.1145\/3406325.3451107","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451107","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}