Sheu, Jang-PingJang-PingSheuWu, Chun-LienChun-LienWuChen, Gen-HueyGen-HueyChen2009-04-292018-07-052009-04-292018-07-05198901678191https://www.scopus.com/inward/record.uri?eid=2-s2.0-0024717133&doi=10.1016%2f0167-8191%2889%2990044-6&partnerID=40&md5=5c5ddb72a67fc02cf09a6d54db19773cIn this paper, algorithms are proposed for finding the first k largest numbered processes in hypercubes with and without faulty nodes. © 1989.application/pdf206614 bytesapplication/pdfen-USElection problem; hypercubes; k-selection problemComputer Systems, Digital--Parallel Processing; Election Problem; Hypercubes; K Selection Problem; Parallel Algorithms; Computer Programmingjournal article10.1016/0167-8191(89)90044-62-s2.0-0024717133http://ntur.lib.ntu.edu.tw/bitstream/246246/154658/1/05.pdf