{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T18:29:46Z","timestamp":1721759386765},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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":8720,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1016\/0304-3975(89)90027-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"115-120","source":"Crossref","is-referenced-by-count":6,"title":["Complexity of selection in X + Y"],"prefix":"10.1016","volume":"67","author":[{"given":"M.","family":"Cosnard","sequence":"first","affiliation":[]},{"given":"J.","family":"Duprat","sequence":"additional","affiliation":[]},{"given":"A.","family":"Ferreira","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90027-3_BIB1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/360825.360869","article-title":"Sorting X+Y","volume":"18","author":"Harper","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(89)90027-3_BIB2","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1145\/322092.322097","article-title":"Lower bounds for selection in X+Y and other multisets","volume":"25","author":"Johnson","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(89)90027-3_BIB3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1137\/0207013","article-title":"Selecting the k-th element in X+Y and X1+X2+\u22ef+Xm","volume":"7","author":"Johnson","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90027-3_BIB4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0020-0190(85)90123-1","article-title":"Selection in X+Y and matrices with sorted rows and columns","volume":"20","author":"Mirzaian","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(89)90027-3_BIB5_1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(87)90056-9","article-title":"An O(nlgk2n2) time and O(k2nk) space algorithm for certain NP-complete problems","volume":"51","author":"Vysko\u010d","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90027-3_BIB5_2","volume":"68","year":"1989","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900273?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900273?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T09:56:15Z","timestamp":1555062975000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0304397589900273"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90027-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}