| Hwang, H.-K. (1998). Limit theorems for mergesort. Random Structures Algorithms 8, 319--336. |
....on the imaginary line (s) 0, and k = 2ik ln 2 ; k 2 Z: Moreover Flajolet and Golin showed that (Y n Gamma E Y n ) p Var(Y n ) satisfies a central limit theorem applying Lyapunov s condition. Hwang [17] found a local limit theorem and large deviations including rates of convergence and, in [18], gave full (exact) asymptotic expansions for the mean and variance. Cramer [7] obtained the (central) limit law applying the contraction method. For methodological reasons we rederive this limit law on the basis of the expansions (57) including the representation for 5 directly from Corollary ....
Hwang, H.-K. (1998). Limit theorems for mergesort. Random Structures Algorithms 8, 319--336.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC