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
Abstract. We present new parallel sorting networks for 17 to 20 inputs. For 17, 19, and 20 inputs th...
Abstract. Megiddo introduced a technique for using a parallel algorithm for one problem to construct...
Parallel sorting techniques have become of practical interest with the advent of new multiprocessor ...
AbstractThe number of required deques for sorting all sequences of n items in a parallel or series n...
AbstractThis paper provides a unifying mathematical proof which replaces a mechanical certification ...
This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting ...
AbstractWe show that in the deterministic comparison model for parallel computation, p = n processor...
The sorting number of a graph with n vertices is the minimum depth of a sorting network with n input...
Sorting networks are a class of parallel oblivious sorting algorithms. Not only do they have interes...
[[abstract]]Given a precedence forest, we develop serial algorithms for ranking and unranking , and ...
We establish a lower bound of (1:12 \Gamma o(1)) n log n on the size of any n-input sorting network...
If G isaconnected graph with N nodes, its r dimensional product contains N r nodes. We present an al...
AbstractA variety of models have been proposed for the study of synchronous parallel computation. Th...
We present a new mathematical model for representing comparator networks together with a new algorit...
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and f...
Abstract. We present new parallel sorting networks for 17 to 20 inputs. For 17, 19, and 20 inputs th...
Abstract. Megiddo introduced a technique for using a parallel algorithm for one problem to construct...
Parallel sorting techniques have become of practical interest with the advent of new multiprocessor ...
AbstractThe number of required deques for sorting all sequences of n items in a parallel or series n...
AbstractThis paper provides a unifying mathematical proof which replaces a mechanical certification ...
This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting ...
AbstractWe show that in the deterministic comparison model for parallel computation, p = n processor...
The sorting number of a graph with n vertices is the minimum depth of a sorting network with n input...
Sorting networks are a class of parallel oblivious sorting algorithms. Not only do they have interes...
[[abstract]]Given a precedence forest, we develop serial algorithms for ranking and unranking , and ...
We establish a lower bound of (1:12 \Gamma o(1)) n log n on the size of any n-input sorting network...
If G isaconnected graph with N nodes, its r dimensional product contains N r nodes. We present an al...
AbstractA variety of models have been proposed for the study of synchronous parallel computation. Th...
We present a new mathematical model for representing comparator networks together with a new algorit...
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and f...
Abstract. We present new parallel sorting networks for 17 to 20 inputs. For 17, 19, and 20 inputs th...
Abstract. Megiddo introduced a technique for using a parallel algorithm for one problem to construct...
Parallel sorting techniques have become of practical interest with the advent of new multiprocessor ...
DOI
Add to ORKG