On Parallel Selection and Searching in P
โ
R. Sarnath; Xin He
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 246 KB
rithm given by Cole [3] runs in O(log n log\* n) time on an EREW PRAM and in O(log n log\* n/log log n) time on a CRCW PRAM. Both algorithms perform O(n) operations. However, not much work has been done on parallel algorithms for constrained selection. The sequential algorithm in [5] is parallelizab