{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:53:35Z","timestamp":1648587215867},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,3,1]],"date-time":"1984-03-01T00:00:00Z","timestamp":446947200000},"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":[[1984,3]]},"DOI":"10.1016\/0196-6774(84)90038-5","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"36-47","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of hashing with chaining in the prime area"],"prefix":"10.1016","volume":"5","author":[{"given":"Per-\u00c5ke","family":"Larson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0196-6774(84)90038-5_BIB1","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1145\/322092.322096","article-title":"The analysis of hashing that exhibit k-ary clustering","volume":"25","author":"Guibas","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(84)90038-5_BIB2","author":"Knuth","year":"1973"},{"key":"10.1016\/0196-6774(84)90038-5_BIB3","doi-asserted-by":"crossref","unstructured":"P.-\u00c5. Larson, Analysis of uniform hashing, J. Assoc. Comput. Mach., in press.","DOI":"10.1145\/2157.322407"},{"issue":"3","key":"10.1016\/0196-6774(84)90038-5_BIB4","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1093\/comjnl\/25.3.347","article-title":"Expected worst-case performance of hash files","volume":"25","author":"Larson","year":"1982","journal-title":"Comput. J."},{"key":"10.1016\/0196-6774(84)90038-5_BIB5","series-title":"Proc. 21st Symp. on Foundations of Computer Science","first-page":"238","article-title":"Tuning the coalesced hashing method to obtain optimum performance","author":"Vitter","year":"1980"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677484900385?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677484900385?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:50:39Z","timestamp":1548744639000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677484900385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["0196677484900385"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(84)90038-5","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}