Paths in a random digital tree: limiting distributions
暂无分享,去创建一个
[1] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .
[2] M. H. van Emden. Increasing the efficiency of quicksort , 1970, CACM.
[3] H. Hurwitz,et al. On the probability distribution of the values of binary trees , 1971, CACM.
[4] Alan G. Konheim,et al. A note on growing binary trees , 1973, Discret. Math..
[5] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .
[6] Ronald Fagin,et al. Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..
[7] Andrew Chi-Chih Yao,et al. A Note on the Analysis of Extendible Hashing , 1980, Inf. Process. Lett..
[8] Mireille Régnier,et al. On the Average Height of Trees in Digital Search and Dynamic Hashing , 1981, Inf. Process. Lett..
[9] Haim Mendelson,et al. Analysis of Extendible Hashing , 1982, IEEE Transactions on Software Engineering.
[10] Philippe Flajolet,et al. A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization , 1982, ICALP.
[11] B. Pittel. Asymptotical Growth of a Class of Random Trees , 1985 .