{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T09:30:46Z","timestamp":1775899846081,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642041273","type":"print"},{"value":"9783642041280","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_61","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"682-693","source":"Crossref","is-referenced-by-count":68,"title":["Hash, Displace, and Compress"],"prefix":"10.1007","author":[{"given":"Djamal","family":"Belazzougui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabiano C.","family":"Botelho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Dietzfelbinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Botelho, F.C., Dietzfelbinger, M.: Hash, displace, and compress. Computer Research Repository (2009)","DOI":"10.1007\/978-3-642-04128-0_61"},{"key":"61_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-73951-7_13","volume-title":"Algorithms and Data Structures","author":"F.C. Botelho","year":"2007","unstructured":"Botelho, F.C., Pagh, R., Ziviani, N.: Simple and space-efficient minimal perfect hash functions. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 139\u2013150. Springer, Heidelberg (2007)"},{"key":"61_CR3","first-page":"30","volume-title":"Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"B. Chazelle","year":"2004","unstructured":"Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The bloomier filter: An efficient data structure for static support lookup tables. In: Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 30\u201339. SIAM, Philadelphia (2004)"},{"key":"61_CR4","unstructured":"Dietzel, L.: Speicherplatzeffiziente perfekte Hashfunktionen. Master\u2019s thesis, Technische Universit\u00e4t Ilmenau (Novmber 2005) (in German)"},{"key":"61_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-74871-7_2","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"M. Dietzfelbinger","year":"2007","unstructured":"Dietzfelbinger, M.: Design strategies for minimal perfect hash functions. In: Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., Nunkesser, M., Widmayer, P. (eds.) SAGA 2007. LNCS, vol.\u00a04665, pp. 2\u201317. Springer, Heidelberg (2007)"},{"key":"61_CR6","volume-title":"Proc. of 36th International Colloquium on Automata, Languages and Programming","author":"M. Dietzfelbinger","year":"2009","unstructured":"Dietzfelbinger, M., Rink, M.: Applications of a splitting trick. In: Proc. of 36th International Colloquium on Automata, Languages and Programming. Springer, Heidelberg (to appear, 2009)"},{"issue":"1-2","key":"61_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2007.02.054","volume":"380","author":"M. Dietzfelbinger","year":"2007","unstructured":"Dietzfelbinger, M., Weidling, C.: Balanced allocation and dictionaries with tightly packed constant size bins. Theoretical Computer Science\u00a0380(1-2), 47\u201368 (2007)","journal-title":"Theoretical Computer Science"},{"key":"61_CR8","unstructured":"Erlingsson, U., Manasse, M., McSherry, F.: A cool and practical alternative to traditional hash tables. In: Proc. of the 7th Workshop on Distributed Data and Structures, pp. 1\u20136 (2006)"},{"issue":"1","key":"61_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2006.12.012","volume":"372","author":"P. Ferragina","year":"2007","unstructured":"Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theoretical Computer Science\u00a0372(1), 115\u2013121 (2007)","journal-title":"Theoretical Computer Science"},{"key":"61_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0605009","volume":"5","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J.: On the size of separating systems and families of perfect hashing functions. SIAM Journal on Algebraic and Discrete Methods\u00a05, 61\u201368 (1984)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"61_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-72845-0_16","volume-title":"Experimental Algorithms","author":"K. Fredriksson","year":"2007","unstructured":"Fredriksson, K., Nikitin, F.: Simple compression code supporting random access and fast string matching. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 203\u2013216. Springer, Heidelberg (2007)"},{"key":"61_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-44693-1_28","volume-title":"STACS 2001","author":"T. Hagerup","year":"2001","unstructured":"Hagerup, T., Tholey, T.: Efficient minimal perfect hashing in nearly minimal space. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 317\u2013326. Springer, Heidelberg (2001)"},{"key":"61_CR13","unstructured":"Litwin, W.: Linear hashing: a new tool for file and table addressing. In: Proc. of the 6th International Conference on Very Large Data Bases, pp. 212\u2013223. VLDB Endowment (1980)"},{"key":"61_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching. Springer, Heidelberg (1984)"},{"key":"61_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005)"},{"key":"61_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-48447-7_5","volume-title":"Algorithms and Data Structures","author":"R. Pagh","year":"1999","unstructured":"Pagh, R.: Hash and displace: Efficient evaluation of minimal perfect hash functions. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 49\u201354. Springer, Heidelberg (1999)"},{"key":"61_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0020-0190(92)90181-T","volume":"41","author":"J. Radhakrishnan","year":"1992","unstructured":"Radhakrishnan, J.: Improved bounds for covering complete uniform hypergraphs. Information Processing Letters\u00a041, 203\u2013207 (1992)","journal-title":"Information Processing Letters"},{"key":"61_CR18","unstructured":"Sanders, P.: Personal communication (2004)"},{"issue":"5","key":"61_CR19","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1137\/0219054","volume":"19","author":"J.P. Schmidt","year":"1990","unstructured":"Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious k-probe hash functions. SIAM Journal on Computing\u00a019(5), 775\u2013786 (1990)","journal-title":"SIAM Journal on Computing"},{"issue":"11","key":"61_CR20","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/359168.359175","volume":"22","author":"R.E. Tarjan","year":"1979","unstructured":"Tarjan, R.E., Yao, A.C.C.: Storing a sparse table. Communications of the ACM\u00a022(11), 606\u2013611 (1979)","journal-title":"Communications of the ACM"},{"key":"61_CR21","first-page":"154","volume-title":"Proc. of the 7th International Workshop on Efficient and Experimental Algorithms","author":"S. Vigna","year":"2008","unstructured":"Vigna, S.: Broadword implementation of rank\/select queries. In: Proc. of the 7th International Workshop on Efficient and Experimental Algorithms, pp. 154\u2013168. ACM Press, New York (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:41:02Z","timestamp":1552142462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}