Finding the median requires 2n comparisons
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
A new lower bound for the set-partitioning problem
SIAM Journal on Computing
Discrete Applied Mathematics
A Counting Approach to Lower Bounds for Selection Problems
Journal of the ACM (JACM)
A Unified Lower Bound for Selection and Set Partitioning Problems
Journal of the ACM (JACM)
New upper bounds for selection
Communications of the ACM
Expected time bounds for selection
Communications of the ACM
A sorting problem and its complexity
Communications of the ACM
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Finding the ith largest of n for small i,n
ACM SIGACT News
Approximate medians and other quantiles in one pass and with limited memory
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Improved upper bounds for time-space trade-offs for selection
Nordic Journal of Computing
An efficient fully polynomial approximation scheme for the Subset-Sum problem
Journal of Computer and System Sciences
Journal of Algorithms
Journal of Algorithms
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Better size estimation for sparse matrix products
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Towards optimal multiple selection
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |