{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T12:11:40Z","timestamp":1768911100364,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"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":[[2011,6,6]]},"DOI":"10.1145\/1993806.1993862","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"297-298","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["A generalization of multiple choice balls-into-bins"],"prefix":"10.1145","author":[{"given":"Gahyun","family":"Park","sequence":"first","affiliation":[{"name":"The State University of New York at Geneseo, Geneseo, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335411"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"key":"e_1_3_2_1_4_1","first-page":"891","volume-title":"SODA","author":"Devroye L.","year":"2007","unstructured":"L. Devroye , G. Lugosi , G. Park , and W. Szpankowski . Multiple choice tries and distributed hash tables . In SODA , pages 891 -- 899 , 2007 . L. Devroye, G. Lugosi, G. Park, and W. Szpankowski. Multiple choice tries and distributed hash tables. In SODA, pages 891--899, 2007."},{"key":"e_1_3_2_1_5_1","first-page":"511","volume-title":"SODA","author":"Godfrey P. B.","year":"2008","unstructured":"P. B. Godfrey . Balls and bins with structure: balanced allocations on hypergraphs . In SODA , pages 511 -- 517 , 2008 . P. B. Godfrey. Balls and bins with structure: balanced allocations on hypergraphs. In SODA, pages 511--517, 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873732"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792546"}],"event":{"name":"PODC '11: ACM Symposium on Principles of Distributed Computing","location":"San Jose California USA","acronym":"PODC '11","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993862","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993806.1993862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:52Z","timestamp":1750244752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":8,"alternative-id":["10.1145\/1993806.1993862","10.1145\/1993806"],"URL":"https:\/\/doi.org\/10.1145\/1993806.1993862","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}