DOIAbstract
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n then n objects can be sorted in r rounds by asking no more than 2r+1n1+1/r(log n)2-2/r/(log log n)(r-1/r questions in each round
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n then n objects can be sorted in r rounds by asking no more than 2r+1n1+1/r(log n)2-2/r/(log log n)(r-1/r questions in each round
We show that a unit-cost RAM with a word length of $w$ bits can sort $n$ integers in the range $0\Tt...
Sorting by means of a two-way merge has a reputation of requiring a clerically complicated and cumbe...
I examine different parallel algorithms for sorting in rounds. Most of these algorithms use a gra...
The main result of the paper is that if n is sufficiently large and 2≤r=r(n)≤log log log n then n ob...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
Abstract. We present upper bounds for sorting and selecting the median in a fixed number of rounds. ...
In this paper we give a positive answer to the long-standing problem of finding an in-place sorting...
We present the first in-place algorithm for sorting an array of size n that performs, in the worst c...
We show that n integers in the range 1 : : n can be sorted stably on an EREW PRAM using O(t) time an...
We settle a long-standing open question, namely whether it is possible to sort a sequence of n eleme...
• We will now undertake a more formal study of algorithms for the sorting problem. • This problem is...
AbstractConsider the following problem: If you want to sort n numbers in k (a constant) rounds then ...
We present a randomized algorithm sorting n integers in O(n p log logn) expected time and linear spa...
In-place sorting algorithms play an important role in many fields such as very large database system...
We show that n integers in the range 1.. n can be stably sorted on an EREW PRAM using O(t) time and ...
We show that a unit-cost RAM with a word length of $w$ bits can sort $n$ integers in the range $0\Tt...
Sorting by means of a two-way merge has a reputation of requiring a clerically complicated and cumbe...
I examine different parallel algorithms for sorting in rounds. Most of these algorithms use a gra...
The main result of the paper is that if n is sufficiently large and 2≤r=r(n)≤log log log n then n ob...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
Abstract. We present upper bounds for sorting and selecting the median in a fixed number of rounds. ...
In this paper we give a positive answer to the long-standing problem of finding an in-place sorting...
We present the first in-place algorithm for sorting an array of size n that performs, in the worst c...
We show that n integers in the range 1 : : n can be sorted stably on an EREW PRAM using O(t) time an...
We settle a long-standing open question, namely whether it is possible to sort a sequence of n eleme...
• We will now undertake a more formal study of algorithms for the sorting problem. • This problem is...
AbstractConsider the following problem: If you want to sort n numbers in k (a constant) rounds then ...
We present a randomized algorithm sorting n integers in O(n p log logn) expected time and linear spa...
In-place sorting algorithms play an important role in many fields such as very large database system...
We show that n integers in the range 1.. n can be stably sorted on an EREW PRAM using O(t) time and ...
We show that a unit-cost RAM with a word length of $w$ bits can sort $n$ integers in the range $0\Tt...
Sorting by means of a two-way merge has a reputation of requiring a clerically complicated and cumbe...
I examine different parallel algorithms for sorting in rounds. Most of these algorithms use a gra...
Add to ORKG