Optimal algorithms for selection on a mesh-connected processor array
Danny Kriz̧anc, Lata Narayanan · 2003
The authors present novel algorithms for selecting an elements of specified rank among N=n/sup 2/ elements on an n*n mesh-connected processor array, in a variety of settings. They give: (1) an optimal randomized algorithm for selecting the element of rank k out of N, 1>