Add to ORKGThe number of comparisons required to select he i-th smallest of n numbers is shown to be at most a linear function of n by analysis of a new selection algorithm--PICK. Specifically, no more than 5.4305 n comparisons are ever required. This bound is improved for extreme values of i, and a new lower bound on the requisite number of comparisons i also proved
. Sequential selection has been solved in linear time by Blum e.a. Running this algorithm on a probl...
We revisit the selection problem, namely that of computing the ith order statistic of n given elemen...
We revisit the selection problem, namely that of computing the ith order statistic of n given elemen...
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a...
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a...
Lower bounds are derived on the number of comparisons to solve several well-known selection problems...
AbstractWe show that several versions of Floyd and Rivest's algorithm SELECT for finding the kth sma...
AbstractWe show that in the deterministic comparison model for parallel computation, p = n processor...
AbstractHoare's selection algorithm for finding the kth-largest element in a set of n elements is sh...
We consider the problem of selecting the r -smallest element from a list of n elements under a mo...
Sequential selection has been solved in linear time by Blum e.a. Running this algorithm on a problem...
By developing and exploiting new in-place techniques, we show that finding the element with the medi...
By developing and exploiting new in-place techniques, we show that finding the element with the medi...
We consider the problem of selecting the rth -smallest element from a list of nelements under a mode...
In this paper we present a randomized selection algorithm that with high probability , for any const...
. Sequential selection has been solved in linear time by Blum e.a. Running this algorithm on a probl...
We revisit the selection problem, namely that of computing the ith order statistic of n given elemen...
We revisit the selection problem, namely that of computing the ith order statistic of n given elemen...
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a...
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a...
Lower bounds are derived on the number of comparisons to solve several well-known selection problems...
AbstractWe show that several versions of Floyd and Rivest's algorithm SELECT for finding the kth sma...
AbstractWe show that in the deterministic comparison model for parallel computation, p = n processor...
AbstractHoare's selection algorithm for finding the kth-largest element in a set of n elements is sh...
We consider the problem of selecting the r -smallest element from a list of n elements under a mo...
Sequential selection has been solved in linear time by Blum e.a. Running this algorithm on a problem...
By developing and exploiting new in-place techniques, we show that finding the element with the medi...
By developing and exploiting new in-place techniques, we show that finding the element with the medi...
We consider the problem of selecting the rth -smallest element from a list of nelements under a mode...
In this paper we present a randomized selection algorithm that with high probability , for any const...
. Sequential selection has been solved in linear time by Blum e.a. Running this algorithm on a probl...
We revisit the selection problem, namely that of computing the ith order statistic of n given elemen...
We revisit the selection problem, namely that of computing the ith order statistic of n given elemen...