{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T09:05:33Z","timestamp":1750669533733,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0964473"],"award-info":[{"award-number":["IIS-0964473"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0915922"],"award-info":[{"award-number":["CCF-0915922"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-1011840"],"award-info":[{"award-number":["CNS-1011840"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612684","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"331-342","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Balanced allocations and double hashing"],"prefix":"10.1145","author":[{"given":"Michael","family":"Mitzenmacher","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge , MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The Probabilistic Method","author":"Alon N.","year":"1992","unstructured":"N. Alon and J. Spencer . The Probabilistic Method , John Wiley & Sons , 1992 . N. Alon and J. Spencer. The Probabilistic Method, John Wiley & Sons, 1992."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-65371-1","volume-title":"Branching Processes","author":"Athreya K.","year":"1972","unstructured":"K. Athreya and P. Ney . Branching Processes . Springer-Verlag , 1972 . K. Athreya and P. Ney. Branching Processes.Springer-Verlag, 1972."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_3_2_1_4_1","volume-title":"Fast pseudo-random fingerprints. Arxiv preprint arXiv:1009.5791","author":"Porat E.","year":"2010","unstructured":". Bachrach and E. Porat . Fast pseudo-random fingerprints. Arxiv preprint arXiv:1009.5791 , 2010 . . Bachrach and E. Porat. Fast pseudo-random fingerprints. Arxiv preprint arXiv:1009.5791, 2010."},{"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.1137\/S009753970444630X"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-012-9311-0"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.49"},{"key":"e_1_3_2_1_11_1","first-page":"16","volume-title":"Li.In Proc. of the USENIX Technical Conference","year":"2010","unstructured":"ChunkStash : speeding up inline storage deduplication using flash memory.B. Debnath, S. Sengupta, and J . Li.In Proc. of the USENIX Technical Conference , p. 16 , 2010 . ChunkStash: speeding up inline storage deduplication using flash memory.B. Debnath, S. Sengupta, and J. Li.In Proc. of the USENIX Technical Conference, p.16, 2010."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2010.04.002"},{"key":"e_1_3_2_1_13_1","first-page":"367","volume-title":"Bloom Filters in Probabilistic Verification.In Proc. of the 5th International Conference on Formal Methods in Computer-Aided Design","author":"Dillinger P.C.","year":"2004","unstructured":"P.C. Dillinger and P. Manolios . Bloom Filters in Probabilistic Verification.In Proc. of the 5th International Conference on Formal Methods in Computer-Aided Design , pp. 367 -- 381 , 2004 . P.C. Dillinger and P. Manolios. Bloom Filters in Probabilistic Verification.In Proc. of the 5th International Conference on Formal Methods in Computer-Aided Design, pp. 367--381, 2004."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316658","volume-title":"Markov Processes: Characterization and Convergence","author":"Ethier S. N.","year":"1986","unstructured":"S. N. Ethier and T. G. Kurtz . Markov Processes: Characterization and Convergence . John Wiley and Sons , 1986 . S. N. Ethier and T. G. Kurtz. Markov Processes: Characterization and Convergence.John Wiley and Sons, 1986."},{"key":"e_1_3_2_1_15_1","volume-title":"balanced allocations on hypergraphs.In Proc. of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms,pp. 511--517","author":"Godfrey P.","year":"2008","unstructured":"P. Godfrey .Balls and bins with structure : balanced allocations on hypergraphs.In Proc. of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms,pp. 511--517 , 2008 . P. Godfrey.Balls and bins with structure: balanced allocations on hypergraphs.In Proc. of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms,pp. 511--517, 2008."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90046-6"},{"key":"e_1_3_2_1_17_1","first-page":"141","volume-title":"Proc. of ALENEX\/ANALCO","author":"Heileman G.","year":"2005","unstructured":"G. Heileman and W. Luo . How caching affects hashing .In Proc. of ALENEX\/ANALCO , pp. 141 -- 154 , 2005 . G. Heileman and W. Luo.How caching affects hashing.In Proc. of ALENEX\/ANALCO, pp. 141--154, 2005."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109606"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v33:2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-765-3_9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/3212147"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1960.10.1181"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202791"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"e_1_3_2_1_26_1","volume-title":"Inequalities: Theory of Majorization and Its Applications","author":"Marshall A.","year":"2010","unstructured":"A. Marshall , I. Olkin , and B. Arnold . Inequalities: Theory of Majorization and Its Applications ( 2 nd Edition).Springer-Verlag, 2010 . A. Marshall, I. Olkin, and B. Arnold. Inequalities: Theory of Majorization and Its Applications (2nd Edition).Springer-Verlag, 2010.","edition":"2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.963420"},{"key":"e_1_3_2_1_28_1","unstructured":". Mitzenmacher.\n  The power of two choicesin randomized load balancing\n  . Ph.D. thesis 1996\n  .   . Mitzenmacher. The power of two choicesin randomized load balancing. Ph.D. thesis 1996."},{"key":"e_1_3_2_1_29_1","first-page":"255","volume-title":"Handbook of Randomized Computing, (P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim, edds)","author":"Richa A.","year":"2001","unstructured":". Mitzenmacher, A. Richa , and R. Sitaraman . The Power of Two Choices: A Survey of Techniques and Results . In Handbook of Randomized Computing, (P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim, edds) , pp. 255 -- 312 , Kluwer Academic Publishers , Norwell, MA , 2001 . . Mitzenmacher, A. Richa, and R. Sitaraman. The Power of Two Choices: A Survey of Techniques and Results. In Handbook of Randomized Computing, (P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim, edds), pp. 255--312, Kluwer Academic Publishers, Norwell, MA, 2001."},{"key":"e_1_3_2_1_30_1","first-page":"1118","volume-title":"Peeling Arguments and Double Hashing.In Proc. of Allerton","author":"Mitzenmacher M.","year":"2012","unstructured":"M. Mitzenmacher and J. Thaler . Peeling Arguments and Double Hashing.In Proc. of Allerton 2012 , pp. 1118 -- 1125 . M. Mitzenmacher and J. Thaler.Peeling Arguments and Double Hashing.In Proc. of Allerton 2012, pp. 1118--1125."},{"volume-title":"Probability and computing: Randomized algorithms and probabilistic analysis,2005","author":"Mitzenmacher M.","key":"e_1_3_2_1_31_1","unstructured":"M. Mitzenmacher and E. Upfal . Probability and computing: Randomized algorithms and probabilistic analysis,2005 , Cambridge University Press . M. Mitzenmacher and E. Upfal. Probability and computing: Randomized algorithms and probabilistic analysis,2005, Cambridge University Press."},{"key":"e_1_3_2_1_32_1","first-page":"326","volume-title":"Improved.In Proc. of Allerton","author":"Mitzenmacher M.","year":"1999","unstructured":"M. Mitzenmacher and B. V\u00f6cking . The Asymptotics of Selecting the Shortest of Two , Improved.In Proc. of Allerton 1999 , pp. 326 -- 327 . M. Mitzenmacher and B. V\u00f6cking.The Asymptotics of Selecting the Shortest of Two, Improved.In Proc. of Allerton 1999, pp. 326--327."},{"key":"e_1_3_2_1_33_1","first-page":"746","volume-title":"Proc. of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Vadhan S.","year":"2008","unstructured":". Mitzenmacher and S. Vadhan . Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream . In Proc. of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 746 -- 755 , 2008 . . Mitzenmacher and S. Vadhan. Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream. In Proc. of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 746--755, 2008."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/110827831"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993638"},{"key":"e_1_3_2_1_36_1","unstructured":"Y. Peres K. Talwar and U. Wieder.The (1  Y. Peres K. Talwar and U. Wieder.The (1"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873732"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579445"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/647010.712824"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792546"},{"key":"e_1_3_2_1_41_1","first-page":"15","article-title":"Queueing system with selection of the shortest of two queues: an asymptotic approach","volume":"32","author":"Vvedenskaya N.D.","year":"1996","unstructured":"N.D. Vvedenskaya , R.L. Dobrushin , and F.I. Karpelevich . Queueing system with selection of the shortest of two queues: an asymptotic approach . Problems of Information Transmission , 32 : 15 -- 27 , 1996 . N.D. Vvedenskaya, R.L. Dobrushin, and F.I. Karpelevich. Queueing system with selection of the shortest of two queues: an asymptotic approach. Problems of Information Transmission, 32:15--27, 1996.","journal-title":"Problems of Information Transmission"},{"key":"e_1_3_2_1_42_1","volume-title":"of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms,pp. 424--433","author":"Woelfel P.","year":"2006","unstructured":"P. Woelfel .Asymmetric balanced allocation with simple hash functions.In Proc. of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms,pp. 424--433 , 2006 . P. Woelfel.Asymmetric balanced allocation with simple hash functions.In Proc. of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms,pp. 424--433, 2006."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004612"}],"event":{"name":"SPAA '14: 26th 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"],"location":"Prague Czech Republic","acronym":"SPAA '14"},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612684","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612684","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":42,"alternative-id":["10.1145\/2612669.2612684","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612684","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}