1623 search results - page 100 / 325 » No Sorting |
133
click to vote
CORR
2000
Springer
15 years 4 months ago
2000
Springer
Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere ...
110
click to vote
CORR
2000
Springer
15 years 4 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...
127
click to vote
JGS
2000
15 years 4 months ago
2000
Abstract. Suppose that geographic data under investigation are rates associated with polygons. For example, disease incidence, mortality, and census undercount data may be displaye...
164
click to vote
DM
1999
15 years 4 months ago
1999
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
142
click to vote
MST
1998
15 years 4 months ago
1998
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...