Performance engineering case study: heap construction
Journal of Experimental Algorithmics (JEA)
Journal of Algorithms - Analysis of algorithms
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
Quickselect and the Dickman Function
Combinatorics, Probability and Computing
Comparisons in Hoare's Find Algorithm
Combinatorics, Probability and Computing
Adaptive sampling for quickselect
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On Floyd and Rivest's SELECT algorithm
Theoretical Computer Science
An integrated efficient solution for computing frequent and top-k elements in data streams
ACM Transactions on Database Systems (TODS)
The Number of Symbol Comparisons in QuickSort and QuickSelect
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On Smoothed Analysis of Quicksort and Hoare's Find
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Adaptive sampling strategies for quickselects
ACM Transactions on Algorithms (TALG)
The analysis of Range Quickselect and related problems
Theoretical Computer Science
Efficient computation of frequent and top-k elements in data streams
ICDT'05 Proceedings of the 10th international conference on Database Theory
| Hi-index | 0.00 |