739 search results - page 3 / 148 » Sorting Algorithms |
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorti...
ACSC
2003
IEEE
13 years 11 months ago
2003
IEEE
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
IEEEPACT
2007
IEEE
14 years 1 months ago
2007
IEEE
Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both SIMD instructions and threadlevel parallelism. In this...
JCB
2007
13 years 7 months ago
2007
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
It is well known that n integers in the range [1, nc ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1, U] can be sorted i...