{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T11:03:05Z","timestamp":1743591785558,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_51","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"611-622","source":"Crossref","is-referenced-by-count":24,"title":["More Robust Hashing: Cuckoo Hashing with a Stash"],"prefix":"10.1007","author":[{"given":"Adam","family":"Kirsch","sequence":"first","affiliation":[]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[]},{"given":"Udi","family":"Wieder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"51_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0020-0190(02)00500-8","volume":"86","author":"L. Devroye","year":"2003","unstructured":"Devroye, L., Morin, P.: Cuckoo Hashing: Further Analysis. Information Processing Letters\u00a086(4), 215\u2013219 (2003)","journal-title":"Information Processing Letters"},{"issue":"1-2","key":"51_CR2","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":"51_CR3","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Woelfel, P.: Almost Random Graphs with Simple Hash Functions. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (STOC), pp. 629\u2013638 (2003)","DOI":"10.1145\/780542.780634"},{"issue":"2","key":"51_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.: Space Efficient Hash Tables With Worst Case Constant Access Time. Theory of Computing Systems\u00a038(2), 229\u2013248 (2005)","journal-title":"Theory of Computing Systems"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Kirsch, A., Mitzenmacher, M.: The Power of One Move: Hashing Schemes for Hardware. In: Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM) (2008)","DOI":"10.1109\/INFOCOM.2008.30"},{"key":"51_CR6","unstructured":"Kirsch, A., Mitzenmacher, M.: Using a Queue to De-amortize Cuckoo Hashing in Hardware. In: Proceedings of the Forty-Fifth Annual Allerton Conference on Communication, Control, and Computing (2007)"},{"key":"51_CR7","unstructured":"Kirsch, A., Mitzenmacher, M., Wieder, U.: More Robust Hashing: Cuckoo Hashing with a Stash (manuscript, Temporary version), \n                      http:\/\/www.eecs.harvard.edu\/~kirsch\/pubs\/"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Kutzelnigg, R.: Bipartite Random Graphs and Cuckoo Hashing. In: Proceedings of the Fourth Colloquium on Mathematics and Computer Science (2006)","DOI":"10.46298\/dmtcs.3486"},{"key":"51_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"51_CR10","unstructured":"Naor, M., Segev, G., Wieder, U.: History Independent Cuckoo Hashing. In: Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP) (to appear, 2008)"},{"issue":"2","key":"51_CR11","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.: Cuckoo Hashing. Journal of Algorithms\u00a051(2), 122\u2013144 (2004)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:19:04Z","timestamp":1715059144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}