{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:39:21Z","timestamp":1765960761986},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_51","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:22:47Z","timestamp":1376623367000},"page":"601-612","source":"Crossref","is-referenced-by-count":6,"title":["Balls into Bins Made Faster"],"prefix":"10.1007","author":[{"given":"Megha","family":"Khosla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"51_CR1","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced allocations. SIAM Journal on Computing\u00a029(1), 180\u2013200 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"51_CR2","unstructured":"Cain, J.A., Sanders, P., Wormald, N.: The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation. In: ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 469\u2013476 (2007)"},{"key":"51_CR3","unstructured":"Fernholz, D., Ramachandran, V.: The k-orientability thresholds for gn, p. In: ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 459\u2013468 (2007)"},{"key":"51_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-36494-3_25","volume-title":"STACS 2003","author":"D. Fotakis","year":"2003","unstructured":"Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.: Space efficient hash tables with worst case constant access time. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 271\u2013282. Springer, Heidelberg (2003)"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Khosla, M., Panagiotou, K.: The multiple-orientability thresholds for random hypergraphs. In: ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 1222\u20131236 (2011)","DOI":"10.1137\/1.9781611973082.93"},{"issue":"3","key":"51_CR6","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1002\/rsa.20426","volume":"41","author":"N. Fountoulakis","year":"2012","unstructured":"Fountoulakis, N., Panagiotou, K.: Sharp load thresholds for cuckoo hashing. Random Structures & Algorithms\u00a041(3), 306\u2013333 (2012)","journal-title":"Random Structures & Algorithms"},{"key":"51_CR7","unstructured":"Fountoulakis, N., Panagiotou, K., Steger, A.: On the insertion time of cuckoo hashing. CoRR, abs\/1006.1231 (2010)"},{"issue":"3","key":"51_CR8","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1002\/rsa.20427","volume":"41","author":"A. Frieze","year":"2012","unstructured":"Frieze, A., Melsted, P.: Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables. Random Structures & Algorithms\u00a041(3), 334\u2013364 (2012)","journal-title":"Random Structures & Algorithms"},{"issue":"2","key":"51_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/090770928","volume":"40","author":"A. Frieze","year":"2011","unstructured":"Frieze, A., Melsted, P., Mitzenmacher, M.: An analysis of random-walk cuckoo hashing. SIAM Journal on Computing\u00a040(2), 291\u2013308 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"51_CR10","unstructured":"Galassi, M., Davies, J., Theiler, J., Gough, B., Jungman, G., Booth, M., Rossi, F.: Gnu scientific library reference manual (2003), \n                  \n                    http:\/\/www.gnu.org\/software\/gsl"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Lelarge, M.: A new approach to the orientation of random hypergraphs. In: ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 251\u2013264 (2012)","DOI":"10.1137\/1.9781611973099.23"},{"key":"51_CR12","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Richa, A., Sitaraman, R.: The power of two random choices: A survey of techniques and results. In: Handbook of Randomized Algorithms, pp. 255\u2013312 (2000)","DOI":"10.1007\/978-1-4615-0013-1_9"},{"issue":"6","key":"51_CR13","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1145\/195613.195663","volume":"41","author":"R. Motwani","year":"1994","unstructured":"Motwani, R.: Average-case analysis of algorithms for matchings and related problems. J. ACM\u00a041(6), 1329\u20131356 (1994)","journal-title":"J. ACM"},{"key":"51_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44676-1_10","volume-title":"Algorithms - ESA 2001","author":"R. Pagh","year":"2001","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 121\u2013133. Springer, Heidelberg (2001)"},{"key":"51_CR15","unstructured":"Sanders, P., Egner, S., Korst, J.: Fast concurrent access to parallel disks. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 849\u2013858 (1999)"},{"key":"51_CR16","doi-asserted-by":"crossref","unstructured":"Schlegel, B., Gemulla, R., Lehner, W.: Fast integer compression using simd instructions. In: Workshop on Data Management on New Hardware, DaMoN 2010, pp. 34\u201340. ACM (2010)","DOI":"10.1145\/1869389.1869394"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:10:17Z","timestamp":1558026617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}