{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T18:27:30Z","timestamp":1672338450042},"reference-count":9,"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)90036-1","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"7-21","source":"Crossref","is-referenced-by-count":7,"title":["Direct-chaining with coalescing lists"],"prefix":"10.1016","volume":"5","author":[{"given":"Gary D","family":"Knott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0196-6774(84)90036-1_BIB1","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0020-0190(75)90004-6","article-title":"A dual link data structure for random file organization","volume":"4","author":"Bannerjee","year":"1975","journal-title":"Inform. Process. Lett."},{"issue":"No. 2","key":"10.1016\/0196-6774(84)90036-1_BIB2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/361952.361964","article-title":"Reducing the retrieval time of scatter storage techniques","volume":"16","author":"Brent","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(84)90036-1_BIB3","article-title":"The Analysis of Hashing Algorithms","author":"Guibas","year":"1976"},{"issue":"No. 3","key":"10.1016\/0196-6774(84)90036-1_BIB4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1093\/comjnl\/18.3.265","article-title":"Hashing functions","volume":"18","author":"Knott","year":"1975","journal-title":"Comput. J."},{"key":"10.1016\/0196-6774(84)90036-1_BIB5","author":"Knuth","year":"1971"},{"key":"10.1016\/0196-6774(84)90036-1_BIB6","author":"Knuth","year":"1973"},{"issue":"No. 2","key":"10.1016\/0196-6774(84)90036-1_BIB7","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1147\/rd.12.0130","article-title":"Addressing for random access storage","volume":"1","author":"Peterson","year":"1957","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0196-6774(84)90036-1_BIB8","article-title":"Analysis of Coalesced Hashing","author":"Vitter","year":"1980"},{"issue":"No. 6","key":"10.1016\/0196-6774(84)90036-1_BIB9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/368336.368352","article-title":"Handling identifiers as internal symbols in language processors","volume":"2","author":"Williams","year":"1959","journal-title":"Comm. ACM"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677484900361?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677484900361?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:33Z","timestamp":1548744633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677484900361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["0196677484900361"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(84)90036-1","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}