{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:32:45Z","timestamp":1648679565118},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1979,6,1]],"date-time":"1979-06-01T00:00:00Z","timestamp":297043200000},"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":[[1979,6]]},"DOI":"10.1016\/0020-0190(79)90112-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"230-233","source":"Crossref","is-referenced-by-count":1,"title":["On a generalization of binary search"],"prefix":"10.1016","volume":"8","author":[{"given":"Timo","family":"Leip\u00e4l\u00e4","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90112-1_BIB1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01965719","article-title":"On a problem of optimal search","volume":"21","author":"Gottinger","year":"1977","journal-title":"Z. Operations Res."},{"key":"10.1016\/0020-0190(79)90112-1_BIB2","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(79)90112-1_BIB3","series-title":"Effiziente Algorithmen","author":"Mehlhorn","year":"1977"},{"key":"10.1016\/0020-0190(79)90112-1_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":"Information Processing Lett."},{"key":"10.1016\/0020-0190(79)90112-1_BIB5","series-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold","year":"1977"},{"key":"10.1016\/0020-0190(79)90112-1_BIB6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/359997.360000","article-title":"On self-organizing sequential search heuristics","volume":"19","author":"Rivest","year":"1976","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901121?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901121?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:29:19Z","timestamp":1555086559000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079901121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["0020019079901121"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90112-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}