AbstractThe paper contains the complete results for the complexity of the following three selection problems: (A) Find the 3 top elements (ordered) out of a linear order on n elements. (B) Find the 3rd element out of a linear order on n elements. (C) Find the 3 top elements (unordered) out of a linear order on n elements
We consider the problem of selecting the r -smallest element from a list of n elements under a mo...
summary:An asymptotically optimal sorting algorithm that uses $\Theta (n(log\ n+k))$ component compa...
In this paper we deal with the problem of finding the smallest and the largest elements of an ordere...
AbstractThe paper contains the complete results for the complexity of the following three selection ...
AbstractOne of the best studied problems in combinatorial search theory concerns the selection of th...
Classical problems of sorting and searching assume an underlying linear ordering of the objects bein...
AbstractHoare's selection algorithm for finding the kth-largest element in a set of n elements is sh...
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...
AbstractThe complexity of selection is analyzed for two sets, X + Y and matrices with sorted columns...
AbstractWe show that several versions of Floyd and Rivest's algorithm SELECT for finding the kth sma...
AbstractMany of the well-known selection and sorting problems can be understood as the production of...
Improving a long standing result of Schonhage, Paterson and Pippenger we show that the median of a s...
In this paper we deal with the problem of finding the smallest and the largest elements of a totally...
AbstractThis paper addresses the following question: What is the complexity of sorting n numbers x1,...
We consider the problem of selecting the r -smallest element from a list of n elements under a mo...
summary:An asymptotically optimal sorting algorithm that uses $\Theta (n(log\ n+k))$ component compa...
In this paper we deal with the problem of finding the smallest and the largest elements of an ordere...
AbstractThe paper contains the complete results for the complexity of the following three selection ...
AbstractOne of the best studied problems in combinatorial search theory concerns the selection of th...
Classical problems of sorting and searching assume an underlying linear ordering of the objects bein...
AbstractHoare's selection algorithm for finding the kth-largest element in a set of n elements is sh...
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...
AbstractThe complexity of selection is analyzed for two sets, X + Y and matrices with sorted columns...
AbstractWe show that several versions of Floyd and Rivest's algorithm SELECT for finding the kth sma...
AbstractMany of the well-known selection and sorting problems can be understood as the production of...
Improving a long standing result of Schonhage, Paterson and Pippenger we show that the median of a s...
In this paper we deal with the problem of finding the smallest and the largest elements of a totally...
AbstractThis paper addresses the following question: What is the complexity of sorting n numbers x1,...
We consider the problem of selecting the r -smallest element from a list of n elements under a mo...
summary:An asymptotically optimal sorting algorithm that uses $\Theta (n(log\ n+k))$ component compa...
In this paper we deal with the problem of finding the smallest and the largest elements of an ordere...
DOI
Add to ORKG