Parallel Solutions of Simple Indexed Recurrence Equations
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
An optimal algorithm for sorting integers in the range $[1,n ^ c ]$ (for any constant $c$) is given for the EREW PRAM model where the word length is $n ^ \epsilon $, for any $\epsilon