{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:18:13Z","timestamp":1760707093410},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":[[1985,1]]},"DOI":"10.1016\/0020-0190(85)90123-1","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"13-17","source":"Crossref","is-referenced-by-count":20,"title":["Selection in X + Y and matrices with sorted rows and columns"],"prefix":"10.1016","volume":"20","author":[{"given":"A.","family":"Mirzaian","sequence":"first","affiliation":[]},{"given":"E.","family":"Arjomandi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0020-0190(85)90123-1_BIB1","first-page":"448","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. CSS"},{"key":"10.1016\/0020-0190(85)90123-1_BIB2","first-page":"197","article-title":"The complexity of selection and ranking in X + Y and matrices with sorted columns","volume":"24","author":"Frederickson","year":"1982","journal-title":"J. CSS"},{"issue":"1","key":"10.1016\/0020-0190(85)90123-1_BIB3","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1137\/0213002","article-title":"Generalized selection and ranking: Sorted matrices","volume":"13","author":"Frederickson","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(85)90123-1_BIB4","series-title":"Proc. 7th ACM Symp. on Theory of Computing","first-page":"240","article-title":"Two applications of probabilistic search technique: Sorting X + Y and building balanced search trees","author":"Fredman","year":"1975"},{"issue":"6","key":"10.1016\/0020-0190(85)90123-1_BIB5","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\/0020-0190(85)90123-1_BIB6","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1214\/aoms\/1177704172","article-title":"Estimates of location based on rank tests","volume":"34","author":"Hodges","year":"1963","journal-title":"Ann. Math. Statist."},{"issue":"5","key":"10.1016\/0020-0190(85)90123-1_BIB7","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"},{"issue":"2","key":"10.1016\/0020-0190(85)90123-1_BIB8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1137\/0207013","article-title":"Selecting the kth element in X + Y and X1 + X2 + \u22ef + Xm","volume":"7","author":"Johnson","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(85)90123-1_BIB9","series-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing","first-page":"101","article-title":"Channel routing in VLSI","author":"Mirzaian","year":"1984"},{"key":"10.1016\/0020-0190(85)90123-1_BIB10","series-title":"Algorithms and Complexity: New Directions and Recent Results","first-page":"251","article-title":"Geometry and statistics: Problems at the interface","author":"Shamos","year":"1976"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085901231?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085901231?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:25:59Z","timestamp":1553577959000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019085901231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["0020019085901231"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90123-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}