Randomized selection in n + C + o(n) comparisons

Authors:
Alexandros V. Gerbessiotis;Constantinos J. Siniolakis
Affiliations:
CS Department, New Jersey Institute of Technology, Newark, NJ;The American College of Greece, 6 Gravias St., Aghia Paraskevi, Athens, 15342, Greece
Venue:
Information Processing Letters
Year:
2003

Citing 7
Cited 1

A logarithmic time sort for linear size networks

Journal of the ACM (JACM)
Direct bulk-synchronous parallel algorithms

Journal of Parallel and Distributed Computing
Deterministic sorting and randomized median finding on the BSP model

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A Unified Lower Bound for Selection and Set Partitioning Problems

Journal of the ACM (JACM)
Expected time bounds for selection

Communications of the ACM
Average case selection

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

On Floyd and Rivest's SELECT algorithm

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper we present a randomized selection algorithm that with high probability 1 - 1/nρ, for any constant ρ 1 requires n + C + o(n) comparisons to determine the Cth order statistic of n keys thus matching a corresponding lower bound on the average number of comparisons required. Low order terms in the number of comparisons performed can also be reduced by extending the algorithm of Floyd and Rivest and analyzing its resulting performance more carefully.