{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:45:29Z","timestamp":1787503529258,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"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":[[2022,6,9]]},"DOI":"10.1145\/3519935.3519995","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T11:29:32Z","timestamp":1654860572000},"page":"52-63","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["The power of two choices in graphical allocation"],"prefix":"10.1145","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[{"name":"University of Michigan, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ohad N.","family":"Feldheim","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"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","volume-title":"ICALP (LIPIcs","volume":"16","author":"Alistarh Dan","year":"2020","unstructured":"Dan Alistarh , Giorgi Nadiradze , and Amirmojtaba Sabour . 2020 . Dynamic Averaging Load Balancing on Cycles . In ICALP (LIPIcs , Vol. 168). 7:1\u20137: 16 . Dan Alistarh, Giorgi Nadiradze, and Amirmojtaba Sabour. 2020. Dynamic Averaging Load Balancing on Cycles. In ICALP (LIPIcs, Vol. 168). 7:1\u20137:16."},{"key":"e_1_3_2_1_3_1","volume-title":"Interchanging distance and capacity in probabilistic mappings. CoRR, abs\/0907.3631","author":"Andersen Reid","year":"2009","unstructured":"Reid Andersen and Uriel Feige . 2009. Interchanging distance and capacity in probabilistic mappings. CoRR, abs\/0907.3631 ( 2009 ), arxiv:0907.3631. arxiv:0907.3631 Reid Andersen and Uriel Feige. 2009. Interchanging distance and capacity in probabilistic mappings. CoRR, abs\/0907.3631 (2009), arxiv:0907.3631. arxiv:0907.3631"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.104.7.2127"},{"key":"e_1_3_2_1_5_1","volume-title":"Symposium on theory of computing. 593\u2013602","author":"Azar Yossi","year":"1994","unstructured":"Yossi Azar , Andrei Z. Broder , Anna R. Karlin , and Eli Upfal . 1994 . Balanced allocations . In Symposium on theory of computing. 593\u2013602 . Yossi Azar, Andrei Z. Broder, Anna R. Karlin, and Eli Upfal. 1994. Balanced allocations. In Symposium on theory of computing. 593\u2013602."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.010"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970444435X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646975.711407"},{"key":"e_1_3_2_1_9_1","volume-title":"Dubhashi and Desh Ranjan","author":"Devdatt","year":"1996","unstructured":"Devdatt P. Dubhashi and Desh Ranjan . 1996 . Balls and bins: A study in negative dependence. BRICS Report Series , 3, 25 (1996). Devdatt P. Dubhashi and Desh Ranjan. 1996. Balls and bins: A study in negative dependence. BRICS Report Series, 3, 25 (1996)."},{"key":"e_1_3_2_1_10_1","volume-title":"Symposium on Discrete algorithms. 511\u2013517","author":"Godfrey P. Brighten","year":"2008","unstructured":"P. Brighten Godfrey . 2008 . Balls and bins with structure: balanced allocations on hypergraphs . In Symposium on Discrete algorithms. 511\u2013517 . P. Brighten Godfrey. 2008. Balls and bins with structure: balanced allocations on hypergraphs. In Symposium on Discrete algorithms. 511\u2013517."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777419"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940878"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109606"},{"key":"e_1_3_2_1_14_1","volume-title":"The Power of Two Choices in Randomized Load Balancing. Ph. D. Dissertation","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher . 1991. The Power of Two Choices in Randomized Load Balancing. Ph. D. Dissertation . Harvard University . Michael Mitzenmacher. 1991. The Power of Two Choices in Randomized Load Balancing. Ph. D. Dissertation. Harvard University."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0013-1_9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20558"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/646975.711521"},{"key":"e_1_3_2_1_18_1","unstructured":"Harald R\u00e4cke. 2002. Minimizing Congestion in General Networks. In Foundations of Computer Science FOCS. 43\u201352.  Harald R\u00e4cke. 2002. Minimizing Congestion in General Networks. In Foundations of Computer Science FOCS. 43\u201352."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374415"},{"key":"e_1_3_2_1_20_1","volume-title":"Computing Cut-Based Hierarchical Decompositions in Almost Linear Time. In Symposium on Discrete Algorithms, SODA. 227\u2013238","author":"R\u00e4cke Harald","year":"2014","unstructured":"Harald R\u00e4cke , Chintan Shah , and Hanjo T\u00e4ubig . 2014 . Computing Cut-Based Hierarchical Decompositions in Almost Linear Time. In Symposium on Discrete Algorithms, SODA. 227\u2013238 . Harald R\u00e4cke, Chintan Shah, and Hanjo T\u00e4ubig. 2014. Computing Cut-Based Hierarchical Decompositions in Almost Linear Time. In Symposium on Discrete Algorithms, SODA. 227\u2013238."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/237502.237565"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Kunal Talwar and Udi Wieder. 2014. Balanced allocations: A simple proof for the heavily loaded case. In International Colloquium on Automata Languages and Programming. 979\u2013990.  Kunal Talwar and Udi Wieder. 2014. Balanced allocations: A simple proof for the heavily loaded case. In International Colloquium on Automata Languages and Programming. 979\u2013990.","DOI":"10.1007\/978-3-662-43948-7_81"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792546"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000070"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519995","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3519995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:49:39Z","timestamp":1750254579000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519995"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":24,"alternative-id":["10.1145\/3519935.3519995","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3519995","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}