{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:35:23Z","timestamp":1649039723876},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":[[1996,8]]},"DOI":"10.1016\/0020-0190(96)00100-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:27:49Z","timestamp":1027600069000},"page":"117-122","source":"Crossref","is-referenced-by-count":3,"title":["Optimal parallel selection in sorted matrices"],"prefix":"10.1016","volume":"59","author":[{"given":"Hong","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarnath","family":"Ramnath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00100-7_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(84)90128-5","article-title":"An optimal algorithm for parallel selection","volume":"19","author":"Akl","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00100-7_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":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(96)00100-7_BIB3","series-title":"Proc. Mathematical Foundations of Computer Science","article-title":"Approximate and exact deterministic parallel selection","author":"Chaudhuri","year":"1993"},{"key":"10.1016\/0020-0190(96)00100-7_BIB4","first-page":"1","article-title":"Bitonic selection network and bitonic selection algorithm on multiprocessors","volume":"24","author":"Chen","year":"1987","journal-title":"Computer Studies and Development"},{"key":"10.1016\/0020-0190(96)00100-7_BIB5","first-page":"523","article-title":"Parallel selection using recursive filtering","volume":"11","author":"Chen","year":"1988","journal-title":"Chinese J. Comput."},{"key":"10.1016\/0020-0190(96)00100-7_BIB6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0020-0190(85)90080-8","article-title":"A parallel median algorithm","volume":"20","author":"Cole","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00100-7_BIB7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0020-0190(88)90186-X","article-title":"An optimally efficient selection algorithm","volume":"26","author":"Cole","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00100-7_BIB8","doi-asserted-by":"crossref","DOI":"10.1137\/0213002","article-title":"Generalized selection and ranking: Sorted matrices","author":"Frederickson","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00100-7_BIB9","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/322123.322128","article-title":"A counting approach to lower bounds for selection problems","volume":"26","author":"Fussenegger","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(96)00100-7_BIB10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/0205010","article-title":"Bounds for selection","volume":"5","author":"Hyafil","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00100-7_BIB11","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1145\/322234.322245","article-title":"A unified lower bound for selection and set partitioning problems","volume":"28","author":"Kirkpatrick","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(96)00100-7_BIB12","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1989.63509","article-title":"On the network complexity of selection","author":"Plaxton","year":"1989"},{"key":"10.1016\/0020-0190(96)00100-7_BIB13","series-title":"Proc. Ann. Symp. on Switching and Atomata Theory","article-title":"On lower bounds for computing the ith largest element","author":"Pratt","year":"1973"},{"key":"10.1016\/0020-0190(96)00100-7_BIB14","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1006\/jagm.1993.1019","article-title":"The parallel simplicity of compaction and chaining","volume":"14","author":"Ragde","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(96)00100-7_BIB15","series-title":"Proc. 6th Internat. Parallel Processing Symp.","article-title":"Efficient parallel algorithms for selection and searching on sorted matrices","author":"Sarnath","year":"1992"},{"key":"10.1016\/0020-0190(96)00100-7_BIB16","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","article-title":"Finding the median","volume":"13","author":"Schonhage","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(96)00100-7_BIB17","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-8191(92)90076-J","article-title":"Improved universal k-selection in hypercubes","volume":"18","author":"Shen","year":"1992","journal-title":"Parallel Comput."},{"key":"10.1016\/0020-0190(96)00100-7_BIB18","first-page":"88","article-title":"A new upper bound of delay time in selection network","volume":"13","author":"Shen","year":"1990","journal-title":"Chinese J. Comput."},{"key":"10.1016\/0020-0190(96)00100-7_BIB19","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1145\/360336.360339","article-title":"New bounds for selection","volume":"19","author":"Yap","year":"1976","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001007?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001007?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:53:30Z","timestamp":1556643210000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096001007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0020019096001007"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00100-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}