This paper introduces a parallel sorting algorithm based on QuickSort and having an n-input, n-processor, time complexity of O(log n) exhibited using a CRCW PRAM model. Although existing algorithms of similar complexity are known, this approach leads to a family of algorithms with a considerably lower constant. It is also significant in its close relationship to a standard sequential algorithm
In this paper we present GPU-Quicksort, an efficient Quicksort algorithm suitable for highly paralle...
List ranking and list scan are two primitive operations used in many parallel algorithms that use li...
We present an optimal algorithm for sorting n integers in the range [1, nc ] (for any constant c) fo...
Abstract. We consider the problem of sorting n numbers that contain only k distinct values. We prese...
Quicksort and its variations remain one of the most popular and effective data sorting algorithms. S...
Rajasekaran and Reif considered the problem of sorting n integers, each in the range {l,..., n}, in ...
Quicksort is well-know algorithm used for sorting, making O(n log n) comparisons to sort a dataset o...
In this paper, we consider a parallel algorithm for the patience sorting. The problem is not known t...
AbstractWe present a simple deterministic parallel algorithm that runs on a CRCW PRAM and sorts n in...
(eng) Cole presented a parallel merge sort for the PRAM model that performs in log n parallel steps ...
Quicksort is one of the most popular sorting algorithms, it is based on a divide-and-conquer techniq...
Abstract.We assume a parallel RAM model which allows both concurrent reads and concurrent writes of ...
Abstract. We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and ...
AbstractWe consider the problem of deterministic sorting of integers on a parallel RAM (PRAM). The b...
We study the parallel complexity of some problems in terms of their expected times. Specifically we ...
In this paper we present GPU-Quicksort, an efficient Quicksort algorithm suitable for highly paralle...
List ranking and list scan are two primitive operations used in many parallel algorithms that use li...
We present an optimal algorithm for sorting n integers in the range [1, nc ] (for any constant c) fo...
Abstract. We consider the problem of sorting n numbers that contain only k distinct values. We prese...
Quicksort and its variations remain one of the most popular and effective data sorting algorithms. S...
Rajasekaran and Reif considered the problem of sorting n integers, each in the range {l,..., n}, in ...
Quicksort is well-know algorithm used for sorting, making O(n log n) comparisons to sort a dataset o...
In this paper, we consider a parallel algorithm for the patience sorting. The problem is not known t...
AbstractWe present a simple deterministic parallel algorithm that runs on a CRCW PRAM and sorts n in...
(eng) Cole presented a parallel merge sort for the PRAM model that performs in log n parallel steps ...
Quicksort is one of the most popular sorting algorithms, it is based on a divide-and-conquer techniq...
Abstract.We assume a parallel RAM model which allows both concurrent reads and concurrent writes of ...
Abstract. We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and ...
AbstractWe consider the problem of deterministic sorting of integers on a parallel RAM (PRAM). The b...
We study the parallel complexity of some problems in terms of their expected times. Specifically we ...
In this paper we present GPU-Quicksort, an efficient Quicksort algorithm suitable for highly paralle...
List ranking and list scan are two primitive operations used in many parallel algorithms that use li...
We present an optimal algorithm for sorting n integers in the range [1, nc ] (for any constant c) fo...
DOI
Add to ORKG