Cited in
(17)- Exponential bounds for the running time of a selection algorithm
- Determining the mode
- Selection by distributive partitioning
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- A time warping approach to multiple sequence alignment
- Weighted median algorithms for \(L_ 1\) approximation
- Computing projection depth and its associated estimators
- Efficient sorting during repetitive statistical computations: Algorithms and an application
- Biostrings
- KDTREE
- Quicksort
- Find
- TVR-DART
- Computing halfspace depth contours based on the idea of a circular sequence
- Algorithm 347
- On Floyd and Rivest's SELECT algorithm
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
This page was built for software: Algorithm 489
