338 search results - page 1 / 68 » Perfect simulation from the Quicksort limit distribution |
CORR
2000
Springer
13 years 5 months ago
2000
Springer
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...
SIAMCOMP
2002
13 years 4 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
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...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
d Abstract) James Allen Fill1† 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Baltimore, MD 21218-2682 USA received 2...
JSAC
2008
13 years 5 months ago
2008
Abstract--We consider the design of multiple-input multipleoutput communication systems with a linear precoder at the transmitter, zero-forcing decision feedback equalization (ZFDF...