{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:32:00Z","timestamp":1757539920775},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1989,8]]},"DOI":"10.1016\/0167-8191(89)90044-6","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"381-384","source":"Crossref","is-referenced-by-count":4,"title":["Selection of the first k largest processes in hypercubes"],"prefix":"10.1016","volume":"11","author":[{"given":"Jang-Ping","family":"Sheu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Lien","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gen-Huey","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(89)90044-6_BIB1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0020-0190(88)90067-1","article-title":"Order statistics on a hypercube","volume":"27","author":"Chandran","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(89)90044-6_BIB2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","article-title":"An O(n log n) unidirectional distributed algorithm for extrema finding in a circle","volume":"3","author":"Dolev","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-8191(89)90044-6_BIB3","series-title":"The Art of Computer Programming Vol. 3: Sorting and Searching","author":"Knuth","year":"1974"},{"key":"10.1016\/0167-8191(89)90044-6_BIB4","series-title":"Proc. 3rd Annual ACM Symposium on Principles of Distributed Computing","first-page":"199","article-title":"Tight lower and upper bounds for some distributed algorithms for a complete network of processors","author":"Korach","year":"1984"},{"key":"10.1016\/0167-8191(89)90044-6_BIB5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(86)90025-6","article-title":"Election in a complete network with a sense of direction","volume":"22","author":"Loui","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(89)90044-6_BIB6","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/0743-7315(87)90031-1","article-title":"Analysis of a distributed algorithm for extrema finding in a ring","volume":"4","author":"Rotem","year":"1987","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0167-8191(89)90044-6_BIB7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0167-8191(89)90024-0","article-title":"Data communication in parallel architectures","volume":"11","author":"Saad","year":"1989","journal-title":"Parallel Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900446?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900446?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:25:05Z","timestamp":1551086705000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819189900446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["0167819189900446"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(89)90044-6","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}