{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:05:56Z","timestamp":1648857956853},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1016\/0196-6774(85)90042-2","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"253-264","source":"Crossref","is-referenced-by-count":2,"title":["On optimal arrangements of keys with double hashing"],"prefix":"10.1016","volume":"6","author":[{"given":"Andrew C","family":"Yao","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90042-2_BIB1_1","first-page":"455","article-title":"On random matrices","volume":"8","author":"Erd\u00f6s","year":"1964","journal-title":"Magyar Tud. Akad. Mat. Kutato Intnat. K\u00f6zl."},{"key":"10.1016\/0196-6774(85)90042-2_BIB1_2","first-page":"625","article-title":"The Art of Counting","author":"Erd\u00f6s","year":"1973"},{"key":"10.1016\/0196-6774(85)90042-2_BIB2","series-title":"Proceedings of the Conference on Theoretical Computer Science","first-page":"159","article-title":"Average lower bounds for open-addressing hash coding","author":"Gonnet","year":"1977"},{"key":"10.1016\/0196-6774(85)90042-2_BIB3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1137\/0208038","article-title":"Efficient ordering of hash tables","volume":"8","author":"Gonnet","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90042-2_BIB4","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0022-0000(78)90046-6","article-title":"The analysis of double hashing","volume":"16","author":"Guibas","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(85)90042-2_BIB5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","article-title":"On representations of subsets","volume":"10","author":"Hall","year":"1934","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0196-6774(85)90042-2_BIB6","series-title":"Foundations of Probability","author":"R\u00e9nyi","year":"1970"},{"key":"10.1016\/0196-6774(85)90042-2_BIB7","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/322063.322065","article-title":"Optimal arrangement of keys in a hash table","volume":"25","author":"Rivest","year":"1978","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900422?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900422?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:26:19Z","timestamp":1548743179000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["0196677485900422"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90042-2","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}