{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:57:20Z","timestamp":1764842240444,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"BSF-NSF","award":["2017758"],"award-info":[{"award-number":["2017758"]}]},{"name":"European Union's Horizon 2020 research and innovation program","award":["742754"],"award-info":[{"award-number":["742754"]}]},{"name":"Minera","award":["713238"],"award-info":[{"award-number":["713238"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323203","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"313-322","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Parallel Balanced Allocations"],"prefix":"10.1145","author":[{"given":"Christoph","family":"Lenzen","sequence":"first","affiliation":[{"name":"MPI for Informatics, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Merav","family":"Parter","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eylon","family":"Yogev","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/299633.299636"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611499"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Berenbrink Petra","key":"e_1_3_2_1_4_1","unstructured":"Petra Berenbrink , Artur Czumaj , Matthias Englert , Tom Friedetzky , and Lars Nagel . 2012. Multiple-choice balanced allocation in (almost) parallel . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques . Springer , 411--422. Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, and Lars Nagel. 2012. Multiple-choice balanced allocation in (almost) parallel. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques . Springer, 411--422."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970444435X"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1941-0003498-3"},{"key":"e_1_3_2_1_7_1","volume-title":"2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) . SIAM, 44--54","author":"Bertrand Pierre","year":"2014","unstructured":"Pierre Bertrand and Christoph Lenzen . 2014 . The 1--2--3-toolkit for building your own balls-into-bins algorithm . In 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) . SIAM, 44--54 . Pierre Bertrand and Christoph Lenzen. 2014. The 1--2--3-toolkit for building your own balls-into-bins algorithm. In 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) . SIAM, 44--54."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/299633.299634"},{"key":"e_1_3_2_1_9_1","first-page":"1","article-title":"On the Liapunoff limit of error in the theory of probability","volume":"28","author":"Esseen C.G.","year":"1942","unstructured":"C.G. Esseen . 1942 . On the Liapunoff limit of error in the theory of probability . Ark. Mat. Astron. Fys. , Vol. A28 , 9 (1942), 1 -- 19 . C.G. Esseen. 1942. On the Liapunoff limit of error in the theory of probability. Ark. Mat. Astron. Fys., Vol. A28, 9 (1942), 1--19.","journal-title":"Ark. Mat. Astron. Fys."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0225-4"},{"key":"e_1_3_2_1_11_1","volume-title":"Load Balancing with Memory. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16--19 November 2002, Vancouver, BC, Canada, Proceedings . 799--808","author":"Mitzenmacher Michael","year":"2002","unstructured":"Michael Mitzenmacher , Balaji Prabhakar , and Devavrat Shah . 2002 . Load Balancing with Memory. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16--19 November 2002, Vancouver, BC, Canada, Proceedings . 799--808 . Michael Mitzenmacher, Balaji Prabhakar, and Devavrat Shah. 2002. Load Balancing with Memory. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16--19 November 2002, Vancouver, BC, Canada, Proceedings . 799--808."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.86"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023397"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/237502.237565"},{"key":"e_1_3_2_1_15_1","volume-title":"41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8--11, 2014, Proceedings, Part I. 979--990","author":"Talwar Kunal","year":"2014","unstructured":"Kunal Talwar and Udi Wieder . 2014 . Balanced Allocations: A Simple Proof for the Heavily Loaded Case. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8--11, 2014, Proceedings, Part I. 979--990 . Kunal Talwar and Udi Wieder. 2014. Balanced Allocations: A Simple Proof for the Heavily Loaded Case. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8--11, 2014, Proceedings, Part I. 979--990."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792546"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000070"}],"event":{"name":"SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures","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"],"location":"Phoenix AZ USA","acronym":"SPAA '19"},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323203","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:16Z","timestamp":1750202596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323203"}},"subtitle":["The Heavily Loaded Case"],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":17,"alternative-id":["10.1145\/3323165.3323203","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323203","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}