AbstractThe number of required deques for sorting all sequences of n items in a parallel or series network of deques is considered. It is shown that the optimal number of required deques is O(n12) for a parallel network, while it is O(log n) for a series network. These orders, O(n12) and O(log n), also remain valid for the networks of restricted deques
This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting ...
AbstractWe show thatnintegers in the range 1,…,ncan be sorted stably on an EREW PRAM usingO(t) time ...
In the comparison model the only operations allowed on input elements are comparisons and moves to e...
AbstractThe number of required deques for sorting all sequences of n items in a parallel or series n...
Knuth introduced the problem of sorting with a sequence of stacks. Tarjan extended this idea to sort...
The problem of determining which permutations can be sorted using certain switchyard networks is a v...
AbstractThis paper provides a unifying mathematical proof which replaces a mechanical certification ...
We study sorting by queues that can rearrange their content by applying permutations from a predefin...
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and f...
Sorting with stacks is a collection of problems that deal with sorting a sequence of numbers by push...
AbstractWe present a simple deterministic parallel algorithm that runs on a CRCW PRAM and sorts n in...
Sorting networks are a class of parallel oblivious sorting algorithms. Not only do they have interes...
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomo...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
We show that n integers in the range 1.. n can be stably sorted on an EREW PRAM using O(t) time and ...
This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting ...
AbstractWe show thatnintegers in the range 1,…,ncan be sorted stably on an EREW PRAM usingO(t) time ...
In the comparison model the only operations allowed on input elements are comparisons and moves to e...
AbstractThe number of required deques for sorting all sequences of n items in a parallel or series n...
Knuth introduced the problem of sorting with a sequence of stacks. Tarjan extended this idea to sort...
The problem of determining which permutations can be sorted using certain switchyard networks is a v...
AbstractThis paper provides a unifying mathematical proof which replaces a mechanical certification ...
We study sorting by queues that can rearrange their content by applying permutations from a predefin...
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and f...
Sorting with stacks is a collection of problems that deal with sorting a sequence of numbers by push...
AbstractWe present a simple deterministic parallel algorithm that runs on a CRCW PRAM and sorts n in...
Sorting networks are a class of parallel oblivious sorting algorithms. Not only do they have interes...
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomo...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
We show that n integers in the range 1.. n can be stably sorted on an EREW PRAM using O(t) time and ...
This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting ...
AbstractWe show thatnintegers in the range 1,…,ncan be sorted stably on an EREW PRAM usingO(t) time ...
In the comparison model the only operations allowed on input elements are comparisons and moves to e...
DOI
Add to ORKG