{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:22:13Z","timestamp":1648639333275},"reference-count":6,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8325,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1990,10]]},"DOI":"10.1016\/0167-6423(90)90022-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"243-254","source":"Crossref","is-referenced-by-count":1,"title":["Searching by elimination"],"prefix":"10.1016","volume":"14","author":[{"given":"Anne","family":"Kaldewaij","sequence":"first","affiliation":[]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(90)90022-6_BIB1","series-title":"A Method of Programming","author":"Dijkstra","year":"1988"},{"issue":"1","key":"10.1016\/0167-6423(90)90022-6_BIB2","first-page":"5","article-title":"The Linear Search revisited","volume":"10","author":"Dijkstra","year":"1989","journal-title":"Structured Programming"},{"key":"10.1016\/0167-6423(90)90022-6_BIB3","series-title":"A different derivation of the Schoenmakers-Kaldewaij Linear Search","author":"Feijen","year":"1988"},{"key":"10.1016\/0167-6423(90)90022-6_BIB4","series-title":"Fast maximum finding routines","author":"Henglein","year":"1989"},{"key":"10.1016\/0167-6423(90)90022-6_BIB5","series-title":"Mathematics of Program Construction","first-page":"297","article-title":"Searching by Elimination","volume":"375","author":"Kaldewaij","year":"1989"},{"key":"10.1016\/0167-6423(90)90022-6_BIB6","doi-asserted-by":"crossref","first-page":"1300","DOI":"10.1145\/50087.50091","article-title":"Using induction to design algorithms","volume":"31","author":"Manber","year":"1988","journal-title":"Comm. ACM"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642390900226?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642390900226?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:53:24Z","timestamp":1555091604000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642390900226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":6,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["0167642390900226"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(90)90022-6","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}