The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Counting Approach to Lower Bounds for Selection Problems
Journal of the ACM (JACM)
New upper bounds for selection
Communications of the ACM
ON LOWER BOUNDS FOR SELECTION PROBLEMS
ON LOWER BOUNDS FOR SELECTION PROBLEMS
Finding the median requires 2n comparisons
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Finding the ith largest of n for small i,n
ACM SIGACT News
Deterministic sorting and randomized median finding on the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Selecting the k Largest Elements with Parity Tests
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Architecture independent parallel selection with applications to parallel priority queues
Theoretical Computer Science
Randomized selection in n + C + o(n) comparisons
Information Processing Letters
On computing an optimal permutation of ranks for multiselection
Computers & Mathematics with Applications
| Hi-index | 0.01 |