{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:22:49Z","timestamp":1648578169041},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1016\/0196-6774(85)90043-4","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"265-274","source":"Crossref","is-referenced-by-count":6,"title":["An optimal algorithm for finding all the jumps of a monotone step-function"],"prefix":"10.1016","volume":"6","author":[{"given":"Refael","family":"Hassin","sequence":"first","affiliation":[]},{"given":"Nimrod","family":"Megiddo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90043-4_BIB1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/1008620.1008624","article-title":"Algorithms on vector sets","volume":"11","author":"Bentley","year":"1979","journal-title":"SIGACT News"},{"key":"10.1016\/0196-6774(85)90043-4_BIB2","series-title":"Searching a Presorted Set of Vectors","author":"Hassin","year":"1980"},{"key":"10.1016\/0196-6774(85)90043-4_BIB3","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1137\/0209012","article-title":"On the complexity of searching a set of vectors","volume":"9","author":"Hirschberg","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90043-4_BIB4","article-title":"On a multidimensional search problem","volume":"11","author":"Rao Kosaraju","year":"1979","journal-title":"SIGACT News"},{"key":"10.1016\/0196-6774(85)90043-4_BIB5","series-title":"Game Theory","author":"Owen","year":"1968"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900434?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900434?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:26:18Z","timestamp":1548743178000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["0196677485900434"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90043-4","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}