{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:48:38Z","timestamp":1726415318828},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1981,4,1]],"date-time":"1981-04-01T00:00:00Z","timestamp":354931200000},"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":[[1981,4]]},"DOI":"10.1016\/0020-0190(81)90005-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"71-75","source":"Crossref","is-referenced-by-count":20,"title":["Efficient searching using partial ordering"],"prefix":"10.1016","volume":"12","author":[{"given":"A.","family":"Borodin","sequence":"first","affiliation":[]},{"given":"L.J.","family":"Guibas","sequence":"additional","affiliation":[]},{"given":"N.A.","family":"Lynch","sequence":"additional","affiliation":[]},{"given":"A.C.","family":"Yao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(81)90005-3_BIB1","article-title":"An optimal data structure for minimal-storage dynamic member searching","author":"Bentley","year":"1978","journal-title":"CMU"},{"key":"10.1016\/0020-0190(81)90005-3_BIB2","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(81)90005-3_BIB3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. of Math."},{"volume":"Vol. 3","year":"1973","author":"Knuth","key":"10.1016\/0020-0190(81)90005-3_BIB4"},{"key":"10.1016\/0020-0190(81)90005-3_BIB5","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","article-title":"Finding the Median","volume":"13","author":"Sch\u00f6nhage","year":"1976","journal-title":"J. Comput. System Sci."},{"unstructured":"J.I. Munro and H. Suwanda, Implicit data structures, Proc. 11th Annual STOC Symposium, Atlanta, GA, 1979, 109\u2013117","key":"10.1016\/0020-0190(81)90005-3_BIB6"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019081900053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019081900053?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:52:14Z","timestamp":1555087934000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019081900053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,4]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,4]]}},"alternative-id":["0020019081900053"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(81)90005-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1981,4]]}}}