2561 search results - page 2 / 513 » Enhanced Quicksort Algorithm |
DAWAK
1999
Springer
13 years 9 months ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
ESA
2008
Springer
13 years 7 months ago
2008
Springer
SODA
2004
ACM
13 years 6 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...