Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions
暂无分享,去创建一个
[1] Hsien-Kuei Hwang,et al. Profiles of random trees: correlation and width of random recursive trees and binary search trees , 2005, Advances in Applied Probability.
[2] L. Bruce Richmond,et al. The Distribution of Heights of Binary Trees and Other Simple Trees , 1993, Combinatorics, Probability and Computing.
[3] Edward A. Bender,et al. Locally Restricted Compositions III. Adjacent-Part Periodic Inequalities , 2010, Electron. J. Comb..
[4] Luc Devroye,et al. The height of increasing trees , 2008, Random Struct. Algorithms.
[5] Edward A. Bender,et al. Locally Restricted Compositions II. General Restrictions and Infinite Matrices , 2009, Electron. J. Comb..
[6] Hosam M. Mahmoud. Limiting Distributions for Path Lengths in Recursive Trees , 1991 .
[7] Michael Drmota,et al. On the profile of random trees , 1997, Random Struct. Algorithms.
[8] Lajos Takács. On the total heights of random rooted trees , 1992 .
[9] Helmut Prodinger,et al. The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions , 2013, IEEE Transactions on Information Theory.
[10] Helmut Prodinger,et al. Level number sequences for trees , 1987, Discret. Math..
[11] Edward A. Bender,et al. Locally Restricted Compositions I. Restricted Adjacent Differences , 2005, Electron. J. Comb..
[12] T. F. Móri. On random trees , 2002 .
[13] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .
[14] Lajos Takács,et al. Limit distributions for queues and random rooted trees , 1993 .