{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T07:50:35Z","timestamp":1768290635668,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1976,8,1]],"date-time":"1976-08-01T00:00:00Z","timestamp":207705600000},"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":[[1976,8]]},"DOI":"10.1016\/0020-0190(76)90071-5","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T19:38:56Z","timestamp":1034019536000},"page":"82-87","source":"Crossref","is-referenced-by-count":217,"title":["An almost optimal algorithm for unbounded searching"],"prefix":"10.1016","volume":"5","author":[{"given":"Jon Louis","family":"Bentley","sequence":"first","affiliation":[]},{"given":"Andrew Chi-Chih","family":"Yao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(76)90071-5_BIB1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","article-title":"Universal codework sets and representation of the integers","author":"Elias","year":"1975","journal-title":"IEEE Trans. on Information Theory IT-21"},{"key":"10.1016\/0020-0190(76)90071-5_BIB2","article-title":"Economical encoding of commas between strings","author":"Even","year":"1975","journal-title":"TECHNION Techn. Rep. No. 54"},{"key":"10.1016\/0020-0190(76)90071-5_BIB3","series-title":"Information Theory and Reliable Communication","author":"Gallager","year":"1968"},{"key":"10.1016\/0020-0190(76)90071-5_BIB4","series-title":"Tech. Rep. No. 61","article-title":"General methods for parallel searching","author":"Linn","year":"1973"},{"key":"10.1016\/0020-0190(76)90071-5_BIB5","doi-asserted-by":"crossref","unstructured":"R.M. Karp and W.L. Mirankier, Parallel minimax search for a maximum. J. of Comb. Theory 4, pp. 19\u201335.","DOI":"10.1016\/S0021-9800(68)80083-3"},{"key":"10.1016\/0020-0190(76)90071-5_BIB6","series-title":"The Art of Computer Programming, vol. 3 (Sorting and Searching)","author":"Knuth","year":"1975"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019076900715?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019076900715?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T16:56:14Z","timestamp":1583772974000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019076900715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,8]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1976,8]]}},"alternative-id":["0020019076900715"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(76)90071-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1976,8]]}}}