AbstractThe complexity of computing modes and of sorting multisets is considered. Previous lower bounds are improved and an algorithm is given to determine the mode of a multiset in a number of comparisons differing from the lower bound by only a ‘lower order term’
summary:An asymptotically optimal sorting algorithm that uses $\Theta (n(log\ n+k))$ component compa...
We present a new mathematical model for representing comparator networks together with a new algorit...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
We show a relationship between the number of comparisons and the number of I/O operations needed to...
AbstractWe show that in the deterministic comparison model for parallel computation, p = n processor...
In the comparison model the only operations allowed on input elements are comparisons and moves to e...
AbstractAlthough many authors have considered how many ternary comparisons it takes to sort a multis...
AbstractThis paper addresses the following question: What is the complexity of sorting n numbers x1,...
AbstractWe define a sorting problem on an n element set S to be a family 〈A1,…,Ar〉 of disjoint subse...
Lower bounds are derived on the number of comparisons to solve several well-known selection problems...
We consider the problem of sorting n elements in the case of persistent comparison errors. In this p...
In this paper we give a positive answer to the long-standing problem of finding an in-place sorting...
We establish a lower bound of (1:12 \Gamma o(1)) n log n on the size of any n-input sorting network...
AbstractA heap (priority queue) is a data structure for representing a set of items, each item havin...
We present the first in-place algorithm for sorting an array of size n that performs, in the worst c...
summary:An asymptotically optimal sorting algorithm that uses $\Theta (n(log\ n+k))$ component compa...
We present a new mathematical model for representing comparator networks together with a new algorit...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
We show a relationship between the number of comparisons and the number of I/O operations needed to...
AbstractWe show that in the deterministic comparison model for parallel computation, p = n processor...
In the comparison model the only operations allowed on input elements are comparisons and moves to e...
AbstractAlthough many authors have considered how many ternary comparisons it takes to sort a multis...
AbstractThis paper addresses the following question: What is the complexity of sorting n numbers x1,...
AbstractWe define a sorting problem on an n element set S to be a family 〈A1,…,Ar〉 of disjoint subse...
Lower bounds are derived on the number of comparisons to solve several well-known selection problems...
We consider the problem of sorting n elements in the case of persistent comparison errors. In this p...
In this paper we give a positive answer to the long-standing problem of finding an in-place sorting...
We establish a lower bound of (1:12 \Gamma o(1)) n log n on the size of any n-input sorting network...
AbstractA heap (priority queue) is a data structure for representing a set of items, each item havin...
We present the first in-place algorithm for sorting an array of size n that performs, in the worst c...
summary:An asymptotically optimal sorting algorithm that uses $\Theta (n(log\ n+k))$ component compa...
We present a new mathematical model for representing comparator networks together with a new algorit...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
DOI
Add to ORKG