{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:50:33Z","timestamp":1762429833239},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1985,5,1]],"date-time":"1985-05-01T00:00:00Z","timestamp":483753600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1985,5]]},"DOI":"10.1016\/0020-0190(85)90046-8","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"179-181","source":"Crossref","is-referenced-by-count":14,"title":["Interpolation-binary search"],"prefix":"10.1016","volume":"20","author":[{"given":"Nicola","family":"Santoro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey B.","family":"Sidney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0020-0190(85)90046-8_BIB1","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/0020-0190(77)90028-X","article-title":"The interpolation-sequential search algorithm","volume":"6","author":"Gonnet","year":"1977","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/0020-0190(85)90046-8_BIB2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00288534","article-title":"An algorithmic and complexity analysis of interpolation search","volume":"13","author":"Gonnet","year":"1980","journal-title":"Acta Informatic"},{"issue":"12","key":"10.1016\/0020-0190(85)90046-8_BIB3","first-page":"681","article-title":"On interpolation search","volume":"22","author":"van der Nat","year":"1979","journal-title":"Comm. ACM"},{"issue":"6","key":"10.1016\/0020-0190(85)90046-8_BIB4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(77)90072-2","article-title":"Understanding the complexity of interpolation search","volume":"6","author":"Perl","year":"1977","journal-title":"Inform. Process. Lett."},{"issue":"7","key":"10.1016\/0020-0190(85)90046-8_BIB5","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/359545.359557","article-title":"Interpolation search\u2014a log log N search","volume":"21","author":"Perl","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(85)90046-8_BIB6","series-title":"Proc. 17th FOCS","first-page":"173","article-title":"The complexity of searching an ordered random table","author":"Yao","year":"1976"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900468?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900468?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:26:57Z","timestamp":1553578017000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019085900468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,5]]}},"alternative-id":["0020019085900468"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90046-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}