{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:11:57Z","timestamp":1764688317561},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":[[2003,4]]},"DOI":"10.1016\/s0020-0190(02)00455-6","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T14:44:40Z","timestamp":1046443480000},"page":"23-26","source":"Crossref","is-referenced-by-count":26,"title":["Optimal search for rationals"],"prefix":"10.1016","volume":"86","author":[{"given":"Stephen","family":"Kwek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00455-6_BIB001","series-title":"Introduction to Algorithms","author":"Cormen","year":"1992"},{"key":"10.1016\/S0020-0190(02)00455-6_BIB002","series-title":"Proc. 13th Annual Conference on Computational Learning Theory","first-page":"225","article-title":"The precision of query points as a resource for learning convex polytopes with membership queries","author":"Goldberg","year":"2000"},{"key":"10.1016\/S0020-0190(02)00455-6_BIB003","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0196-6774(85)90043-4","article-title":"An optimal algorithm for finding all the jumps of a monotone step-function","volume":"6","author":"Hassin","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(02)00455-6_BIB004","first-page":"27","article-title":"A generalization of binary search","volume":"709","author":"Karp","year":"1993"},{"key":"10.1016\/S0020-0190(02)00455-6_BIB005","series-title":"The Art of Computer Programming III: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/S0020-0190(02)00455-6_BIB006","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(79)90079-6","article-title":"Efficient search for rationals","volume":"8","author":"Papadimitriou","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00455-6_BIB007","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(79)90150-9","article-title":"Rational search","volume":"8","author":"Reiss","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00455-6_BIB008","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0020-0190(02)00455-6_BIB009","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0167-6377(81)90023-7","article-title":"On search over rationals","volume":"1","author":"Zemel","year":"1981","journal-title":"Oper. Res. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004556?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004556?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T14:27:48Z","timestamp":1553956068000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002004556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0020019002004556"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00455-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}