Abstract: This paper presents a selection algorithm for finding the k-th largest element in the c... more Abstract: This paper presents a selection algorithm for finding the k-th largest element in the cartesian sum of two sets X and Y, each of size n, on a mesh connected model. The algorithm has a time complexity of, using P processors, where P< n 2. The algorithm is ...
Abstract: This paper presents a selection algorithm for finding the k-th largest element in the c... more Abstract: This paper presents a selection algorithm for finding the k-th largest element in the cartesian sum of two sets X and Y, each of size n, on a mesh connected model. The algorithm has a time complexity of, using P processors, where P< n 2. The algorithm is ...
Uploads
Papers by Tarun Anand