On the internal path length of d -dimensional quad trees
暂无分享,去创建一个
[1] Luc Devroye,et al. An Analysis of Random d-Dimensional Quad Trees , 1990, SIAM J. Comput..
[2] Philippe Flajolet,et al. Search costs in quadtrees and singularity perturbation asymptotics , 1994, Discret. Comput. Geom..
[3] U. Rösler. A limit theorem for "Quicksort" , 1991, RAIRO Theor. Informatics Appl..
[4] James Allen Fill,et al. Total Path Length for Random Recursive Trees , 1999, Combinatorics, Probability and Computing.
[5] Philippe Flajolet,et al. Hypergeometrics and the Cost Structure of Quadtrees , 1995, Random Struct. Algorithms.
[6] Hosam M. Mahmoud,et al. Evolution of random search trees , 1991, Wiley-Interscience series in discrete mathematics and optimization.
[7] S. Rachev. The Monge–Kantorovich Mass Transference Problem and Its Stochastic Applications , 1985 .
[8] Luc Devroye,et al. A note on the height of binary search trees , 1986, JACM.
[9] U. Rösler. A fixed point theorem for distributions , 1992 .
[10] Mireille Régnier. A Limiting Distribution for Quicksort , 1989, RAIRO Theor. Informatics Appl..
[11] Luc Devroye. Universal Limit Laws for Depths in Random Trees , 1998, SIAM J. Comput..
[12] S. Rachev,et al. Probability metrics and recursive algorithms , 1995, Advances in Applied Probability.