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
AbstractWe define two conditions on a random access machine (RAM) with arithmetic and Boolean instru...
AbstractWe present a fast deterministic algorithm for integer sorting in linear space. Our algorithm...
We present the first in-place algorithm for sorting an array of size n that performs, in the worst c...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
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...
AbstractWe show that if n is sufficiently large then there is a graph G of order n with ⌊n32logn⌋ ed...
We show that a unit-cost RAM with a word length of $w$ bits can sort $n$ integers in the range $0\Tt...
AbstractWe show that a unit-cost RAM with a word length ofwbits can sortnintegers in the range 0…2w−...
AbstractWe define a sorting problem on an n element set S to be a family 〈A1,…,Ar〉 of disjoint subse...
We show that $n$ integers in the range $1 \twodots n$ can be stably sorted on an \linebreak EREW PRA...
AbstractWe show thatnintegers in the range 1,…,ncan be sorted stably on an EREW PRAM usingO(t) time ...
We show that n integers in the range 1 : : n can be sorted stably on an EREW PRAM using O(t) time an...
AbstractWe present a simple deterministic parallel algorithm that runs on a CRCW PRAM and sorts n in...
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 two conditions on a random access machine (RAM) with arithmetic and Boolean instru...
AbstractWe present a fast deterministic algorithm for integer sorting in linear space. Our algorithm...
We present the first in-place algorithm for sorting an array of size n that performs, in the worst c...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
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...
AbstractWe show that if n is sufficiently large then there is a graph G of order n with ⌊n32logn⌋ ed...
We show that a unit-cost RAM with a word length of $w$ bits can sort $n$ integers in the range $0\Tt...
AbstractWe show that a unit-cost RAM with a word length ofwbits can sortnintegers in the range 0…2w−...
AbstractWe define a sorting problem on an n element set S to be a family 〈A1,…,Ar〉 of disjoint subse...
We show that $n$ integers in the range $1 \twodots n$ can be stably sorted on an \linebreak EREW PRA...
AbstractWe show thatnintegers in the range 1,…,ncan be sorted stably on an EREW PRAM usingO(t) time ...
We show that n integers in the range 1 : : n can be sorted stably on an EREW PRAM using O(t) time an...
AbstractWe present a simple deterministic parallel algorithm that runs on a CRCW PRAM and sorts n in...
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 two conditions on a random access machine (RAM) with arithmetic and Boolean instru...
AbstractWe present a fast deterministic algorithm for integer sorting in linear space. Our algorithm...
We present the first in-place algorithm for sorting an array of size n that performs, in the worst c...
DOI
Add to ORKG