{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:31:10Z","timestamp":1758475870479},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_14","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"166-178","source":"Crossref","is-referenced-by-count":15,"title":["Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins"],"prefix":"10.1007","author":[{"given":"Martin","family":"Dietzfelbinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Weidling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"2000","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations. SIAM J. Comput.\u00a029, 180\u2013200 (2000)","journal-title":"SIAM J. Comput."},{"key":"14_CR2","first-page":"745","volume-title":"32nd STOC","author":"P. Berenbrink","year":"2000","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced allocations: The heavily loaded case. In: 32nd STOC, pp. 745\u2013754. ACM, New York (2000)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1137\/S009753979529564X","volume":"29","author":"A. Czumaj","year":"2000","unstructured":"Czumaj, A., Meyer auf der Heide, F., Stemann, V.: Contention resolution in hashing based shared memory simulations. SIAM J.\u00a0Comput.\u00a029, 1703\u20131739 (2000)","journal-title":"SIAM J.\u00a0Comput."},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-540-45198-3_21","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Czumaj","year":"2003","unstructured":"Czumaj, A., Riley, C., Scheideler, C.: Perfectly balanced allocation. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 240\u2013251. Springer, Heidelberg (2003)"},{"key":"14_CR5","volume-title":"Graph Theory","author":"R. Diestel","year":"1997","unstructured":"Diestel, R.: Graph Theory. Springer, New York (1997)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Meyer auf der Heide, F.: Dynamic hashing in real time. In: Buchmann, J., et al. (eds.) Informatik \u00b7 Festschrift zum 60. Geburtstag von G\u00fcnter Hotz, B. G. Teubner, pp. 95\u2013119 (1992)","DOI":"10.1007\/978-3-322-95233-2_7"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Weidling, C.: Balanced allocation and dictionaries with tightly packed constant size bins. Technical Report (2005), http:\/\/www.tu-ilmenau.de\/fakia\/md-papers.html","DOI":"10.1007\/11523468_14"},{"key":"14_CR8","first-page":"629","volume-title":"35th STOC","author":"M. Dietzfelbinger","year":"2003","unstructured":"Dietzfelbinger, M., Woelfel, P.: Almost random graphs with simple hash functions. In: 35th STOC, pp. 629\u2013638. ACM, New York (2003)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00224-004-1195-x","volume":"38","author":"D. Fotakis","year":"2005","unstructured":"Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.: Space efficient hash tables with worst case constant access time. Theory of Computing Systems\u00a038, 229\u2013248 (2005)","journal-title":"Theory of Computing Systems"},{"key":"14_CR10","unstructured":"Frieze, A.: Personal communication [1] (1990)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1990","unstructured":"Hagerup, T., R\u00fcb, C.: A guided tour of Chernoff bounds. Inf. Process. Lett.\u00a033, 305\u2013308 (1990)","journal-title":"Inf. Process. Lett."},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0028543","volume-title":"STACS 98","author":"R. Karp","year":"1998","unstructured":"Karp, R.: Random graphs, random walks, differential equations and the probabilistic analysis of algorithms. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 1\u20132. Springer, Heidelberg (1998)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01940878","volume":"16","author":"R. Karp","year":"1996","unstructured":"Karp, R., Luby, M., Meyer auf der Heide, F.: Efficient PRAM simulations on a distributed memory machine. Algorithmica\u00a016, 517\u2013542 (1996)","journal-title":"Algorithmica"},{"key":"14_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/978-1-4615-0013-1_9","volume-title":"Handbook of Randomized Computing","author":"M. Mitzenmacher","year":"2001","unstructured":"Mitzenmacher, M., Richa, A.W., Sitaraman, R.: The power of two random choices: A survey of techniques and results. In: Rajasekaran, et al. (eds.) Handbook of Randomized Computing, vol.\u00a01, pp. 255\u2013312. Kluwer Academic Press, Dordrecht (2001)"},{"key":"14_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"14_CR16","first-page":"622","volume-title":"35th STOC","author":"A. \u00d6stlin","year":"2003","unstructured":"\u00d6stlin, A., Pagh, R.: Uniform hashing in constant time and linear space. In: 35th STOC, pp. 622\u2013628. ACM, New York (2003)"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R. Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms\u00a051, 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"14_CR18","volume-title":"16th SODA","author":"R. Panigrahy","year":"2005","unstructured":"Panigrahy, R.: Efficient hashing with lookups in two memory accesses. In: 16th SODA. ACM-SIAM, New York (2005)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-48518-X_19","volume-title":"Algorithm Engineering and Experimentation","author":"P. Sanders","year":"1999","unstructured":"Sanders, P.: Fast priority queues for cached memory. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol.\u00a01619, pp. 312\u2013327. Springer, Heidelberg (1999)"},{"key":"14_CR20","first-page":"67","volume-title":"12th SODA","author":"P. Sanders","year":"2001","unstructured":"Sanders, P.: Reconciling simplicity and realism in parallel disk models. In: 12th SODA, pp. 67\u201376. ACM-SIAM, New York (2001)"},{"key":"14_CR21","first-page":"849","volume-title":"11th SODA","author":"P. Sanders","year":"2000","unstructured":"Sanders, P., Egner, S., Korst, J.: Fast concurrent access to parallel disks. In: 11th SODA, pp. 849\u2013858. ACM-SIAM, New York (2000)"},{"key":"14_CR22","first-page":"20","volume-title":"30th FOCS","author":"A. Siegel","year":"1989","unstructured":"Siegel, A.: On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In: 30th FOCS, pp. 20\u201325. IEEE, Los Alamitos (1989)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:02Z","timestamp":1605643562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11523468_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}