{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T15:39:30Z","timestamp":1732030770615},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,10,1]],"date-time":"1981-10-01T00:00:00Z","timestamp":370742400000},"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":[[1981,10]]},"DOI":"10.1016\/0020-0190(81)90140-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:20:15Z","timestamp":1027642815000},"page":"4-7","source":"Crossref","is-referenced-by-count":16,"title":["Expected complexity of fast search with uniformly distributed data"],"prefix":"10.1016","volume":"13","author":[{"given":"Gilbert N.","family":"Lewis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nancy J.","family":"Boynton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.Warren","family":"Burton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4\/5","key":"10.1016\/0020-0190(81)90140-X_BIB1","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/0020-0190(80)90139-8","article-title":"A robust variation of interpolation search","volume":"10","author":"Burton","year":"1980","journal-title":"Information Processing Lett"},{"key":"10.1016\/0020-0190(81)90140-X_BIB2","series-title":"An Introduction to Probability Theory and Its Applications","author":"Feller","year":"1968"},{"key":"10.1016\/0020-0190(81)90140-X_BIB3","series-title":"The Art of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(81)90140-X_BIB4","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/359545.359557","article-title":"Interpolation search - a log log n search","volume":"21","author":"Perl","year":"1978","journal-title":"Comm. ACM"},{"issue":"6","key":"10.1016\/0020-0190(81)90140-X_BIB5","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":"Information Processing Lett."},{"key":"10.1016\/0020-0190(81)90140-X_BIB6","doi-asserted-by":"crossref","unstructured":"A.C. Yao and F.F. Yao, The complexity of searching an ordered random table, Proc. 17th Annual Symp. on the Foundations of Computer Science, pp.174\u2013177.","DOI":"10.1109\/SFCS.1976.32"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908190140X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908190140X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:52:16Z","timestamp":1555059136000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908190140X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,10]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,10]]}},"alternative-id":["002001908190140X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(81)90140-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1981,10]]}}}