Randomized selection in n+C+o(n) comparisons
References (11)
- et al.
Fast probabilistic algorithms for Hamiltonian circuits and matchings
J. Comput. System Sci.
(1979) - et al.
Time bounds for selection
J. Comput. System Sci.
(1973) - et al.
Direct bulk-synchronous parallel algorithms
J. Parallel Distributed Comput.
(1994) - et al.
Finding the median
J. Comput. System Sci.
(1976) Random Graphs
(1984)
There are more references available in the full text version of this article.
Cited by (2)
On Floyd and Rivest's SELECT algorithm
2005, Theoretical Computer ScienceA probabilistic analysis of the Floyd-Rivest expected time selection algorithm
2005, International Journal of Computer Mathematics
Copyright © 2003 Elsevier B.V. All rights reserved.