{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T09:30:47Z","timestamp":1775899847719,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642029264","type":"print"},{"value":"9783642029271","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-02927-1_30","type":"book-chapter","created":{"date-parts":[[2009,7,4]],"date-time":"2009-07-04T04:37:10Z","timestamp":1246682230000},"page":"354-365","source":"Crossref","is-referenced-by-count":20,"title":["Applications of a Splitting Trick"],"prefix":"10.1007","author":[{"given":"Martin","family":"Dietzfelbinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Rink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"Carter, L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci.\u00a018(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"30_CR2","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(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"issue":"3","key":"30_CR3","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0097539701386216","volume":"33","author":"A. Siegel","year":"2004","unstructured":"Siegel, A.: On universal classes of extremely random constant-time hash functions. SIAM J. Comput.\u00a033(3), 505\u2013543 (2004)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"30_CR4","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.G.: Space efficient hash tables with worst case constant access time. Theory Comput. Syst.\u00a038(2), 229\u2013248 (2005)","journal-title":"Theory Comput. Syst."},{"issue":"1-2","key":"30_CR5","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. Theor. Comput. Sci.\u00a0380(1-2), 47\u201368 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR6","first-page":"746","volume-title":"Proc. 19th SODA","author":"M. Mitzenmacher","year":"2008","unstructured":"Mitzenmacher, M., Vadhan, S.: Why simple hash functions work: exploiting the entropy in a data stream. In: Proc. 19th SODA, pp. 746\u2013755. SIAM, Philadelphia (2008)"},{"key":"30_CR7","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":"30_CR8","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":"30_CR9","first-page":"622","volume-title":"Proc. 35th STOC","author":"A. \u00d6stlin","year":"2003","unstructured":"\u00d6stlin, A., Pagh, R.: Uniform hashing in constant time and linear space. In: Proc. 35th STOC, pp. 622\u2013628. ACM Press, New York (2003)"},{"key":"30_CR10","first-page":"629","volume-title":"Proc. 35th STOC","author":"M. Dietzfelbinger","year":"2003","unstructured":"Dietzfelbinger, M., Woelfel, P.: Almost random graphs with simple hash functions. In: Proc. 35th STOC, pp. 629\u2013638. ACM Press, New York (2003)"},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1137\/060658400","volume":"38","author":"A. Pagh","year":"2008","unstructured":"Pagh, A., Pagh, R.: Uniform hashing in constant time and optimal space. SIAM J. Comput.\u00a038(1), 85\u201396 (2008)","journal-title":"SIAM J. Comput."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Siegel, A.: On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In: Proc. 30th FOCS, pp. 20\u201325 (1989)","DOI":"10.1109\/SFCS.1989.63450"},{"issue":"6","key":"30_CR13","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1137\/S0097539702405292","volume":"31","author":"H. Buhrman","year":"2002","unstructured":"Buhrman, H., Miltersen, P.B., Radhakrishnan, J., Venkatesh, S.: Are bitvectors optimal? SIAM J. Comput.\u00a031(6), 1723\u20131744 (2002)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"30_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0020-0190(02)00206-5","volume":"83","author":"A. Ta-Shma","year":"2002","unstructured":"Ta-Shma, A.: Storing information with extractors. Inf. Process. Lett.\u00a083(5), 267\u2013274 (2002)","journal-title":"Inf. Process. Lett."},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/3-540-45465-9_38","volume-title":"Automata, Languages and Programming","author":"A. \u00d6stlin","year":"2002","unstructured":"\u00d6stlin, A., Pagh, R.: One-probe search. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 439\u2013450. Springer, Heidelberg (2002)"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BFb0032018","volume-title":"Automata, Languages and Programming","author":"M. Dietzfelbinger","year":"1990","unstructured":"Dietzfelbinger, M., Meyer auf der Heide, F.: A new universal class of hash functions and dynamic hashing in real time. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 6\u201319. Springer, Heidelberg (1990)"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-70575-8_32","volume-title":"Automata, Languages and Programming","author":"M. Dietzfelbinger","year":"2008","unstructured":"Dietzfelbinger, M., Pagh, R.: Succinct data structures for retrieval and approximate membership (Extended abstract). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 385\u2013396. Springer, Heidelberg (2008)"},{"issue":"3","key":"30_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1017\/S0963548397003040","volume":"6","author":"N.J. Calkin","year":"1997","unstructured":"Calkin, N.J.: Dependent sets of constant weight binary vectors. Combinatorics, Probability & Computing\u00a06(3), 263\u2013271 (1997)","journal-title":"Combinatorics, Probability & Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02927-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T20:59:18Z","timestamp":1552078758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02927-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029264","9783642029271"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02927-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}