Algorithm 489: the algorithm SELECT—for finding the ith smallest of n elements [M1]
Communications of the ACM
Algorithms: Algorithm 333: MINIT algorithm for linear programming
Communications of the ACM
Communications of the ACM
Finding the median requires 2n comparisons
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Randomized algorithms and pseudorandom numbers
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Optimal sample cost residues for differential database batch query problems
Journal of the ACM (JACM)
Implementing partition on vector computers
ICS '91 Proceedings of the 5th international conference on Supercomputing
Geometric algorithms for a minimum cost assignment problem
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
An application of the method of Buckets to the selection problem
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Randomized algorithms and pseudorandom numbers
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Deterministic sorting and randomized median finding on the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Parallel construction of multidimensional binary search trees
ICS '96 Proceedings of the 10th international conference on Supercomputing
Practical Algorithms for Selection on Coarse-Grained Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Fast linear expected-time alogorithms for computing maxima and convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Parallel Construction of Multidimensional Binary Search Trees
IEEE Transactions on Parallel and Distributed Systems
Survey on Algorithms 347, 426, and Quicksort
ACM Transactions on Mathematical Software (TOMS)
Remark on “Algorithm 489: The Algorithm SELECT—for Finding the ith Smallest of n Elements [M1]”
ACM Transactions on Mathematical Software (TOMS)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
An efficient dynamic selection method
Communications of the ACM
New upper bounds for selection
Communications of the ACM
Performance engineering case study: heap construction
Journal of Experimental Algorithmics (JEA)
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
Parallel Implementations of the Selection Problem: A Case Study
International Journal of Parallel Programming
Designing Efficient Distributed Algorithms Using Sampling Techniques
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
An Efficient Algorithm for the Approximate Median Selection Problem
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Results of Parallel Implementations of the Selection Problem Using Sisal
PACT '93 Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism
Improved upper bounds for time-space trade-offs for selection
Nordic Journal of Computing
Sorting and selection on parallel disk models
Handbook of massive data sets
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The generation of order statistics in digital computer simulation: A survey
WSC '78 Proceedings of the 10th conference on Winter simulation - Volume 1
Architecture independent parallel selection with applications to parallel priority queues
Theoretical Computer Science
Randomized selection in n + C + o(n) comparisons
Information Processing Letters
Adaptive sampling for quickselect
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Approximate counts and quantiles over sliding windows
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
How (and why) to introduce Monte Carlo randomized algorithms into a basic algorithms course?
Journal of Computing Sciences in Colleges
Packet routing and selection on the POPS network
Journal of Parallel and Distributed Computing
On Floyd and Rivest's SELECT algorithm
Theoretical Computer Science
Journal of Algorithms
Randomized algorithm for the sum selection problem
Theoretical Computer Science
Evolutionary Computing on Consumer Graphics Hardware
IEEE Intelligent Systems
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Tardiness bounds under global EDF scheduling on a multiprocessor
Real-Time Systems
Preservation of proximity privacy in publishing numerical sensitive data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Comparison-based time-space lower bounds for selection
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Robust approximate aggregation in sensor data management systems
ACM Transactions on Database Systems (TODS)
Optimal Randomized Algorithm for the Density Selection Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Journal of Algorithms
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Streaming algorithms for selection and approximate sorting
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Adaptive sampling strategies for quickselects
ACM Transactions on Algorithms (TALG)
Algorithms and theory of computation handbook
Linear-time nearest point algorithms for coxeter lattices
IEEE Transactions on Information Theory
Towards optimal multiple selection
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Range selection and median: tight cell probe lower bounds and adaptive data structures
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Communication and energy efficient routing protocols for single-hop radio networks
Journal of Parallel and Distributed Computing
Enriching introductory programming courses with non-intuitive probability experiments component
Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education
| Hi-index | 48.31 |
A new selection algorithm is presented which is shown to be very efficient on the average, both theoretically and practically. The number of comparisons used to select the ith smallest of n numbers is n + min(i,n-i) + o(n). A lower bound within 9 percent of the above formula is also derived.