{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T21:50:15Z","timestamp":1672264215709},"reference-count":6,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"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":[[1999,9]]},"DOI":"10.1016\/s0020-0190(99)00113-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:21:21Z","timestamp":1027606881000},"page":"183-186","source":"Crossref","is-referenced-by-count":1,"title":["Selecting small ranks in EREW PRAM"],"prefix":"10.1016","volume":"71","author":[{"given":"Sarnath","family":"Ramnath","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(99)00113-1_ID005","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."},{"issue":"6","key":"10.1016\/S0020-0190(99)00113-1_ID006","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."},{"issue":"4","key":"10.1016\/S0020-0190(99)00113-1_ID007","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0020-0190(99)00113-1_ID008","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","article-title":"Upper and lower time bounds for parallel random access machines with out simultaneous writes","volume":"15","author":"Cook","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0020-0190(99)00113-1_ID009","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1006\/jagm.1998.0971","article-title":"Small-rank selection in parallel, with applications to heap construction","volume":"30","author":"Dietz","year":"1999","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(99)00113-1_ID010","first-page":"162","article-title":"Improved upper bounds for time-space tradeoffs for selection with limited storage","volume":"6","author":"Raman","year":"1999","journal-title":"Nordic J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001131?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001131?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:50:21Z","timestamp":1556045421000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019099001131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":6,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0020019099001131"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(99)00113-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}