ON LOWER BOUNDS FOR SELECTION PROBLEMS
ON LOWER BOUNDS FOR SELECTION PROBLEMS
On lower bounds for computing the i-th largest element
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Journal of Computer and System Sciences
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
An Efficient Algorithm for the Approximate Median Selection Problem
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Theoretical Computer Science
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Preface: Festschrift in honor of Arnold Schönhage
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
Journal of Computing Sciences in Colleges
Parallel selection by regular sampling
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Capacity Allocation and Scheduling in Supply Chains
Operations Research
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
Towards optimal multiple selection
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An optimal algorithm for 2 × n bottleneck transportation problems
Operations Research Letters
| Hi-index | 0.00 |
An algorithm is described which determines the median of n elements using in the worst case a number of comparisons asymptotic to 3n.