Add to ORKG[[abstract]]In this paper, we shall show the lower bound of the number of k-sorters needed for a non-adaptive parallel merging algorithm. We then show that the number of k-sorters used in the k?N k-sorter k-way merging algorithm proposed by Tseng and Lee is optimal up to a factor of k +?
The problem of merging ordered sets in the least number of binary comparisons has been solved comple...
In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This ...
[[abstract]]Previous research work on parallel sorting and merging is reviewed. The topics covered i...
Abstract. We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and ...
A variety of models have been proposed for the study of synchronous parallel computation. We review...
Abstract. Merge sort is useful in sorting a great number of data pro-gressively, especially when the...
We present an O(log(min(m,n,j))-time sequential algorithm to select the jth-smallest element of an a...
We investigate the worst case complexity regarding the number of comparisons for a simple and stable...
In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This ...
In this paper we examine the average running times of Batcher's bitonic merge and Batcher's odd-even...
(eng) Cole presented a parallel merge sort for the PRAM model that performs in log n parallel steps ...
In this paper we present a simple parallel sorting algorithm and illustrate two applications. The al...
AbstractThe problem of merging two sorted arrays A = (a1, a2, ..., an1) and B = (b1, b2, ..., bn2) i...
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their...
Abstract. We consider the problem of sorting n numbers that contain only k distinct values. We prese...
The problem of merging ordered sets in the least number of binary comparisons has been solved comple...
In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This ...
[[abstract]]Previous research work on parallel sorting and merging is reviewed. The topics covered i...
Abstract. We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and ...
A variety of models have been proposed for the study of synchronous parallel computation. We review...
Abstract. Merge sort is useful in sorting a great number of data pro-gressively, especially when the...
We present an O(log(min(m,n,j))-time sequential algorithm to select the jth-smallest element of an a...
We investigate the worst case complexity regarding the number of comparisons for a simple and stable...
In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This ...
In this paper we examine the average running times of Batcher's bitonic merge and Batcher's odd-even...
(eng) Cole presented a parallel merge sort for the PRAM model that performs in log n parallel steps ...
In this paper we present a simple parallel sorting algorithm and illustrate two applications. The al...
AbstractThe problem of merging two sorted arrays A = (a1, a2, ..., an1) and B = (b1, b2, ..., bn2) i...
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their...
Abstract. We consider the problem of sorting n numbers that contain only k distinct values. We prese...
The problem of merging ordered sets in the least number of binary comparisons has been solved comple...
In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This ...
[[abstract]]Previous research work on parallel sorting and merging is reviewed. The topics covered i...