Sciweavers

90 search results - page 6 / 18
» Perfect Sorting by Reversals
Sort
View
91
Voted
RECOMB
1997
Springer
15 years 6 months ago
Sorting by reversals is difficult
Alberto Caprara
86
Voted
FOCS
1993
IEEE
15 years 6 months ago
Genome Rearrangements and Sorting by Reversals
Vineet Bafna, Pavel A. Pevzner
ISHPC
2000
Springer
15 years 5 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»
15 years 1 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
15 years 8 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