4315 search results - page 8 / 863 » Sorting in linear time |
SIAMCOMP
2011
13 years 2 months ago
2011
We investigate ways in which an algorithm can improve its expected performance by fine-tuning itself automatically with respect to an arbitrary, unknown input distribution. We gi...
ICPP
1992
IEEE
13 years 11 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
ISHPC
2000
Springer
13 years 11 months ago
2000
Springer
Partitioned parallel radix sort is a parallel radix sort that shortens the execution time by modifying the load balanced radix sort which is known one of the fastest internal sort...
BIOINFORMATICS
2011
13 years 2 months ago
2011
Motivation: The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both ...
ASAP
2000
IEEE
13 years 12 months ago
2000
IEEE
Sorting long sequences of keys is a problem that occurs in many different applications. For embedded systems, a uniprocessor software solution is often not applicable due to the l...