{"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":1775899847205,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642237188","type":"print"},{"value":"9783642237195","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_52","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"615-627","source":"Crossref","is-referenced-by-count":7,"title":["Cuckoo Hashing with Pages"],"prefix":"10.1007","author":[{"given":"Martin","family":"Dietzfelbinger","sequence":"first","affiliation":[]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Rink","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River (1993)"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Alcantara, D.A., Sharf, A., Abbasinejad, F., Sengupta, S., Mitzenmacher, M., Owens, J.D., Amenta, N.: Real-time parallel hashing on the GPU. ACM Trans. Graph.\u00a028(5) (2009)","DOI":"10.1145\/1618452.1618500"},{"key":"52_CR3","first-page":"787","volume-title":"Proc. 51st FOCS","author":"Y. Arbitman","year":"2010","unstructured":"Arbitman, Y., Naor, M., Segev, G.: Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. In: Proc. 51st FOCS, pp. 787\u2013796. IEEE, Los Alamitos (2010)"},{"issue":"7","key":"52_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/Time Trade-offs in Hash Coding with Allowable Errors. Commun. ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"4","key":"52_CR5","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A. Broder","year":"2004","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of Bloom filters: A survey. Internet Mathematics\u00a01(4), 485\u2013509 (2004)","journal-title":"Internet Mathematics"},{"key":"52_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-14165-2_19","volume-title":"Automata, Languages and Programming","author":"M. Dietzfelbinger","year":"2010","unstructured":"Dietzfelbinger, M., Goerdt, A., Mitzenmacher, M., Montanari, A., Pagh, R., Rink, M.: Tight Thresholds for Cuckoo Hashing via XORSAT. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 213\u2013225. Springer, Heidelberg (2010)"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Mitzenmacher, M., Rink, M.: Cuckoo Hashing with Pages. CoRR abs\/1104.5111 (2011)","DOI":"10.1007\/978-3-642-23719-5_52"},{"key":"52_CR8","unstructured":"Erlingsson, \u00da., Manasse, M., McSherry, F.: A cool and practical alternative to traditional hash tables. In: Proc. 7th WDAS (2006)"},{"issue":"2","key":"52_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.G.: Space Efficient Hash Tables with Worst Case Constant Access Time. Theory Comput. Syst.\u00a038(2), 229\u2013248 (2005)","journal-title":"Theory Comput. Syst."},{"key":"52_CR10","first-page":"1222","volume-title":"Proc. 22nd SODA","author":"N. Fountoulakis","year":"2011","unstructured":"Fountoulakis, N., Khosla, M., Panagioutou, K.: The Multiple-orientability Thresholds for Random Hypergraphs. In: Proc. 22nd SODA, pp. 1222\u20131236. SIAM, Philadelphia (2011)"},{"key":"52_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-14165-2_30","volume-title":"Automata, Languages and Programming","author":"N. Fountoulakis","year":"2010","unstructured":"Fountoulakis, N., Panagiotou, K.: Orientability of Random Hypergraphs and the Power of Multiple Choices. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a0ICALP, pp. 348\u2013359. Springer, Heidelberg (2010)"},{"key":"52_CR12","unstructured":"Frieze, A.M., Melsted, P.: Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables. CoRR abs\/0910.5535 (2009)"},{"key":"52_CR13","first-page":"97","volume-title":"Proc. 42nd STOC","author":"P. Gao","year":"2010","unstructured":"Gao, P., Wormald, N.C.: Load balancing and orientability thresholds for random hypergraphs. In: Proc. 42nd STOC, pp. 97\u2013104. ACM, New York (2010)"},{"key":"52_CR14","unstructured":"Gough, B. (ed.): GNU Scientific Library Reference Manual, 3rd edn. Network Theory Ltd (2009), http:\/\/www.gnu.org\/software\/gsl\/manual\/"},{"issue":"4","key":"52_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0190(94)00032-8","volume":"50","author":"U. Manber","year":"1994","unstructured":"Manber, U., Wu, S.: An Algorithm for Approximate Membership checking with Application to Password Security. Inf. Process. Lett.\u00a050(4), 191\u2013197 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"52_CR16","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"},{"key":"52_CR17","first-page":"1297","volume-title":"Proc. 23rd ICDE","author":"K.A. Ross","year":"2007","unstructured":"Ross, K.A.: Efficient Hash Probes on Modern Processors. In: Proc. 23rd ICDE, pp. 1297\u20131301. IEEE, Los Alamitos (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:07:52Z","timestamp":1560528472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}