{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:29:23Z","timestamp":1648510163854},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"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":[[1988,3]]},"DOI":"10.1016\/0020-0190(88)90067-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"129-132","source":"Crossref","is-referenced-by-count":7,"title":["Order statistics on a hypercube"],"prefix":"10.1016","volume":"27","author":[{"given":"Sharat","family":"Chandran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azriel","family":"Rosenfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90067-1_BIB1","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(88)90067-1_BIB2","first-page":"188","article-title":"Deterministic selection in O(loglog n) parallel time","author":"Ajtai","year":"1986","journal-title":"Proc. 18th STOC Conf."},{"issue":"1","key":"10.1016\/0020-0190(88)90067-1_BIB3","doi-asserted-by":"crossref","first-page":"47","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(88)90067-1_BIB4","author":"Akl","year":"1985"},{"key":"10.1016\/0020-0190(88)90067-1_BIB5","first-page":"199","article-title":"Deterministic simulation of idealized parallel computers on more realistic ones","author":"Alt","year":"1986"},{"key":"10.1016\/0020-0190(88)90067-1_BIB6","article-title":"The Hough Transform on the Butterfly and the NCUBE","author":"Chandran","year":"1986"},{"key":"10.1016\/0020-0190(88)90067-1_BIB7","article-title":"An Optimal Selection Algorithm","author":"Cole","year":"1986"},{"issue":"3","key":"10.1016\/0020-0190(88)90067-1_BIB8","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."},{"issue":"9","key":"10.1016\/0020-0190(88)90067-1_BIB9","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/TC.1972.5009071","article-title":"Some computer organizations and their effectiveness","volume":"C-21","author":"Flynn","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(88)90067-1_BIB10","year":"1985"},{"issue":"5","key":"10.1016\/0020-0190(88)90067-1_BIB11","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/TC.1977.1674863","article-title":"The indirect binary n-cube microprocessor array","volume":"C-26","author":"Pease","year":"1977","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/0020-0190(88)90067-1_BIB12","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected-cycle","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(88)90067-1_BIB13","first-page":"212","article-title":"A fast probabilistic sorting algorithm","author":"Reischuk","year":"1981","journal-title":"Proc. 22nd FOCS Conf."},{"issue":"4","key":"10.1016\/0020-0190(88)90067-1_BIB14","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","article-title":"Ultracomputers","volume":"2","author":"Schwartz","year":"1980","journal-title":"ACM Trans. Programming Languages"},{"issue":"1","key":"10.1016\/0020-0190(88)90067-1_BIB15","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","article-title":"The Cosmic Cube","volume":"28","author":"Seitz","year":"1985","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0020-0190(88)90067-1_BIB16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0020-0190(88)90067-1_BIB17","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison problems","volume":"4","author":"Valiant","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(88)90067-1_BIB18","author":"Vishkin","year":"1983"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088900671?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088900671?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:20:45Z","timestamp":1555075245000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088900671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["0020019088900671"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90067-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}