The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On the Optimality of Some Set Algorithms
Journal of the ACM (JACM)
A sorting problem and its complexity
Communications of the ACM
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
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A Unified Lower Bound for Selection and Set Partitioning Problems
Journal of the ACM (JACM)
Selecting the k Largest Elements with Parity Tests
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Generalized selection and ranking (Preliminary Version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Sorting and selection in posets
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Sorting and Selection in Posets
SIAM Journal on Computing
| Hi-index | 0.00 |