暂无分享,去创建一个
[1] Mireille Régnier,et al. New results on the size of tries , 1989, IEEE Trans. Inf. Theory.
[2] Luc Devroye. Universal Limit Laws for Depths in Random Trees , 1998, SIAM J. Comput..
[3] Michael Fuchs,et al. The Wiener Index of Random Digital Trees , 2015, SIAM J. Discret. Math..
[4] L. Rüschendorf,et al. A general limit theorem for recursive algorithms and combinatorial structures , 2004 .
[5] H. Prodinger,et al. ON SOME APPLICATIONS OF FORMULAE OF RAMANUJAN IN THE ANALYSIS OF ALGORITHMS , 1991 .
[6] Philippe Jacquet,et al. Analytical Depoissonization and its Applications , 1998, Theor. Comput. Sci..
[7] Hsien-Kuei Hwang,et al. Asymptotic variance of random symmetric digital search trees , 2009, Discret. Math. Theor. Comput. Sci..
[8] Philippe Flajolet,et al. Mellin Transforms and Asymptotics: Harmonic Sums , 1995, Theor. Comput. Sci..
[9] Helmut Prodinger,et al. On the variance of the external path length in a symmetric digital trie , 1989, Discret. Appl. Math..
[10] Michael Fuchs,et al. A General Central Limit Theorem for Shape Parameters of $m$-ary Tries and PATRICIA Tries , 2014, Electron. J. Comb..
[11] Hsien-Kuei Hwang,et al. Dependence and phase changes in random m-ary search trees , 2017, Random Struct. Algorithms.
[12] Y. L. Tong. The multivariate normal distribution , 1989 .
[13] Mireille Régnier,et al. Trie Partitioning Process: Limiting Distributions , 1986, CAAP.
[14] Werner Schachinger,et al. On the Variance of a Class of Inductive Valuations of Data Structures for Digital Search , 1995, Theor. Comput. Sci..
[15] Ludger Rüschendorf,et al. Survey of Multivariate Aspects of the Contraction Method , 2006, Discret. Math. Theor. Comput. Sci..
[16] Hsien-Kuei Hwang,et al. An analytic approach to the asymptotic variance of trie statistics and related structures , 2013, Theor. Comput. Sci..