{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:47:09Z","timestamp":1756000029189},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"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":[[1989,3]]},"DOI":"10.1016\/0196-6774(89)90021-7","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"20-34","source":"Crossref","is-referenced-by-count":3,"title":["Hash table collision resolution with direct chaining"],"prefix":"10.1016","volume":"10","author":[{"given":"Gary D","family":"Knott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pilar de la","family":"Torre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0196-6774(89)90021-7_BIB1","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1093\/comjnl\/8.3.242","article-title":"Note on the addressing of lists by their source-language names","volume":"8","author":"Elcock","year":"1965","journal-title":"Comput. J."},{"issue":"No. 11","key":"10.1016\/0196-6774(89)90021-7_BIB2","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1145\/355611.362546","article-title":"Comment on Brent's scatter storage algorithm","volume":"16","author":"Feldman","year":"1973","journal-title":"Comm. ACM"},{"issue":"No. 2","key":"10.1016\/0196-6774(89)90021-7_BIB3_1","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. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(89)90021-7_BIB3_2","article-title":"Expected length of the longest probe sequence in hash code searching","author":"Gonnet","year":"1978"},{"issue":"No. 5","key":"10.1016\/0196-6774(89)90021-7_BIB4","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/366532.366540","article-title":"An indirect chaining method for addressing on secondary keys","volume":"4","author":"Johnson","year":"1961","journal-title":"Comm. ACM"},{"issue":"No. 3","key":"10.1016\/0196-6774(89)90021-7_BIB5","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."},{"issue":"No. 1","key":"10.1016\/0196-6774(89)90021-7_BIB6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0196-6774(84)90036-1","article-title":"Direct chaining with coalescing lists","volume":"5","author":"Knott","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(89)90021-7_BIB7","author":"Knuth","year":"1968"},{"key":"10.1016\/0196-6774(89)90021-7_BIB8","author":"Knuth","year":"1973"},{"issue":"No. 1","key":"10.1016\/0196-6774(89)90021-7_BIB9","first-page":"3","article-title":"Algorithms and performance evaluation of a new type of random access file organization","volume":"6","author":"Montgomery","year":"1974","journal-title":"Austral. Comput. J."},{"issue":"No. 1","key":"10.1016\/0196-6774(89)90021-7_BIB10","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/362851.362882","article-title":"Scatter storage techniques","volume":"11","author":"Morris","year":"1968","journal-title":"Comm. ACM"},{"issue":"No. 2","key":"10.1016\/0196-6774(89)90021-7_BIB11","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(89)90021-7_BIB12","article-title":"Analysis of Coalesced Hashing","author":"Vitter","year":"1980"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677489900217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677489900217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:54:53Z","timestamp":1548726893000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677489900217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["0196677489900217"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(89)90021-7","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}