Sciweavers

90 search results - page 6 / 18
» Perfect Sorting by Reversals
Sort
View
RECOMB
1997
Springer
13 years 12 months ago
Sorting by reversals is difficult
Alberto Caprara
ISHPC
2000
Springer
13 years 11 months ago
Partitioned Parallel Radix Sort
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...
Shin-Jae Lee, Minsoo Jeon, Andrew Sohn, Dongseung ...
CORR
2000
Springer
100views Education» more  CORR 2000»
13 years 7 months ago
Perfect simulation from the Quicksort limit distribution
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional...
Luc Devroye, James Allen Fill, Ralph Neininger
HPCC
2007
Springer
14 years 2 months ago
Parallel Database Sort and Join Operations Revisited on Grids
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
Werner Mach, Erich Schikuta