{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:02:05Z","timestamp":1775282525196,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0020-0190(02)00500-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"215-219","source":"Crossref","is-referenced-by-count":53,"title":["Cuckoo hashing: Further analysis"],"prefix":"10.1016","volume":"86","author":[{"given":"Luc","family":"Devroye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00500-8_BIB001","series-title":"Proceedings of the 26th ACM Symposium on the Theory of Computing","first-page":"593","article-title":"Balanced allocations (extended abstract)","author":"Azar","year":"1994"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB002","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/S0097539795288490","article-title":"Balanced allocations","volume":"29","author":"Azar","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00500-8_BIB003","series-title":"Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"43","article-title":"Multilevel adaptive hashing","author":"Broder","year":"1990"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB004","series-title":"INFOCOM 2001","article-title":"Using multiple hash functions to improve IP lookups","author":"Broder","year":"2001"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB005","doi-asserted-by":"crossref","first-page":"1627","DOI":"10.1137\/S0097539795294165","article-title":"Membership in constant time and almost-minimum space","volume":"28","author":"Brodnik","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00500-8_BIB006","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency of tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0020-0190(02)00500-8_BIB007","series-title":"Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS'97), October 19\u201322, 1997, Miami Beach, FL","first-page":"194","article-title":"Randomized allocation processes","author":"Czumaj","year":"1997"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(85)90015-X","article-title":"The expected length of the longest probe sequence when the distribution is not uniform","volume":"6","author":"Devroye","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB009","series-title":"Proceedings of the 17th International Colloquium on Automata, Languages and Programming (ICALP'90)","first-page":"6","article-title":"A new universal class of hash functions and dynamic hashing in real time","volume":"443","author":"Dietzfelbinger","year":"1990"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB010","series-title":"Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP'92)","first-page":"235","article-title":"Polynomial hash functions are reliable (extended abstract)","volume":"623","author":"Dietzfelbinger","year":"1992"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB011","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1137\/S0097539791194094","article-title":"Dynamic perfect hashing: upper and lower bounds","volume":"23","author":"Dietzfelbinger","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00500-8_BIB012","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","article-title":"Storing a sparse table with O(1) worst case access time","volume":"31","author":"Fredman","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB013","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/322248.322254","article-title":"Expected length of the longest probe sequence in hash code searching","volume":"28","author":"Gonnet","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB014","series-title":"Probability and Random Processes","author":"Grimmett","year":"1992"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB015","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2282952","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/S0020-0190(02)00500-8_BIB016","series-title":"Poisson Approximation","author":"Janson","year":"1992"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB017","series-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB018","unstructured":"M. Mitzenmacher, Studying balanced allocations with differential equations, Technical Note 1997024, Digital Equipment Corporation Systems Research Center, Palo Alto, CA, 1997"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB019","doi-asserted-by":"crossref","unstructured":"M. Mitzenmacher, A.W. Richa, R. Sitaraman, The power of two random choices: a survey of techniques and results, Technical Report, 2000","DOI":"10.1007\/978-1-4615-0013-1_9"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB020","doi-asserted-by":"crossref","unstructured":"R. Pagh, F.F. Rodler, Cuckoo hashing, BRICS Report Series RS-01-32, Department of Computer Science, University of Aarhus, 2001","DOI":"10.7146\/brics.v8i32.21692"},{"key":"10.1016\/S0020-0190(02)00500-8_BIB021","series-title":"Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity","first-page":"431","article-title":"Average-case analysis of algorithms and data structures","author":"Vitter","year":"1990"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002005008?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002005008?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T10:00:05Z","timestamp":1584525605000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002005008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0020019002005008"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00500-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}