Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An Efficient Algorithm for the Approximate Median Selection Problem
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Architecture independent parallel selection with applications to parallel priority queues
Theoretical Computer Science
Computing the update of the repeated median regression line in linear time
Information Processing Letters
How (and why) to introduce Monte Carlo randomized algorithms into a basic algorithms course?
Journal of Computing Sciences in Colleges
On Floyd and Rivest's SELECT algorithm
Theoretical Computer Science
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Comparison-based time-space lower bounds for selection
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A simpler implementation and analysis of Chazelle's soft heaps
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Parameterized approximation scheme for the multiple knapsack problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
Parallel selection by regular sampling
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Parameterized Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
Minimum and maximum against k lies
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
| Hi-index | 0.01 |
Improving a long-standing result of Schönhage, Paterson, and Pippenger [ J. Comput. System Sci., 13 (1976), pp. 184--199] we show that the median of a set containing $n$ elements can always be found using at most $c \cdot n$ comparisons, where c