{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T13:32:31Z","timestamp":1776173551720,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf01202791","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T15:51:34Z","timestamp":1108741894000},"page":"83-96","source":"Crossref","is-referenced-by-count":16,"title":["More analysis of double hashing"],"prefix":"10.1007","volume":"13","author":[{"given":"George S.","family":"Lueker","sequence":"first","affiliation":[]},{"given":"Mariko","family":"Molodowitch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0020-0190(78)90014-5","volume":"7","author":"Mikl\ufffds Ajtai","year":"1978","unstructured":"Mikl\ufffds Ajtai, J\ufffdnos Koml\ufffds, andEndre Szemer\ufffddi: There Is No Fast Single Hashing Algorithm,Information Processing Letters 7 (1978), 270?273.","journal-title":"Information Processing Letters"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/77600.77619","volume":"37","author":"B\ufffdla Bollob\ufffds","year":"1990","unstructured":"B\ufffdla Bollob\ufffds, Andrei Z. Broder andIstvan Simon: The Cost Distribution of Clustering in Random Probing,J. ACM 37 (1990), 224?237.","journal-title":"J. ACM"},{"key":"CR3","volume-title":"Handbook of Algorithms and Data Structures: In Pascal and C","author":"G. H. Gonnet","year":"1991","unstructured":"G. H. Gonnet andR. Baeza-Yates:Handbook of Algorithms and Data Structures: In Pascal and C, Second Edition, Addison-Wesley, Wokingham, England, 1991.","edition":"Second Edition"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"Wassily Hoeffding","year":"1963","unstructured":"Wassily Hoeffding: Probability Inequalities for Sums of Bounded Random Variables,J. American Statistical Association 58 (1963), 13?30.","journal-title":"J. American Statistical Association"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1214\/aoms\/1177698243","volume":"39","author":"Kumar Jog-Dev","year":"1968","unstructured":"Kumar Jog-Dev andS. M. Samuels: Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation,The Annals of Mathematical Statistics 39 (1968), 1191?1195.","journal-title":"The Annals of Mathematical Statistics"},{"key":"CR6","unstructured":"J\ufffdnos Koml\ufffds: Private communication, 1986."},{"key":"CR7","unstructured":"Leo J. Guibas: Private communication, Fall 1987."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0022-0000(78)90046-6","volume":"16","author":"Leo J. Guibas","year":"1978","unstructured":"Leo J. Guibas andEndre Szemer\ufffddi: The Analysis of Double Hashing,Journal of Computer and System Sciences 16 (1978), 226?274.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR9","series-title":"Report No. UCB\/CSD 82\/113","volume-title":"The Differencing Method of Set Partititoning","author":"Narendra Karmarkar","year":"1982","unstructured":"Narendra Karmarkar andRichard M. Karp: The Differencing Method of Set Partititoning, Report No. UCB\/CSD 82\/113, Computer Science Division (EECS), University of California, Berkeley, December 1982."},{"key":"CR10","volume-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"D. Knuth:The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, Mass., 1973."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"George S. Lueker andMariko Molodowitch: More Analysis of Double Hashing,Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, IL, May 1988, 354?359.","DOI":"10.1145\/62212.62246"},{"key":"CR12","unstructured":"Nicholas Pippenger: Private communication, January 1988."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Jeanette P. Schmidt andAlan Siegel: On Aspects of the Universality and Performance for Closed Hashing,Proc. 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, May 1989, 355?366.","DOI":"10.1145\/73007.73041"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/321707.321722","volume":"19","author":"Jeffrey D. Ullman","year":"1972","unstructured":"Jeffrey D. Ullman: A Note on the Efficiency of Hash Functions,Journal of the ACM 19 (1972), 569?575.","journal-title":"Journal of the ACM"},{"issue":"3","key":"CR15","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/3828.3836","volume":"32","author":"Andrew C. Yao","year":"1985","unstructured":"Andrew C. Yao: Uniform Hashing Is Optimal,Journal of the ACM 32 3 (1985), 687?693.","journal-title":"Journal of the ACM"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202791.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202791\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:13:58Z","timestamp":1586121238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01202791"],"URL":"https:\/\/doi.org\/10.1007\/bf01202791","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}