Exact and asymptotic distributions in digital and binary search trees
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987) no. 4, pp. 479-495. 
@article{ITA_1987__21_4_479_0,
     author = {Louchard, G.},
     title = {Exact and asymptotic distributions in digital and binary search trees},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {479--495},
     publisher = {EDP-Sciences},
     volume = {21},
     number = {4},
     year = {1987},
     mrnumber = {928772},
     zbl = {0643.68077},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1987__21_4_479_0/}
}
TY  - JOUR
AU  - Louchard, G.
TI  - Exact and asymptotic distributions in digital and binary search trees
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1987
SP  - 479
EP  - 495
VL  - 21
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1987__21_4_479_0/
LA  - en
ID  - ITA_1987__21_4_479_0
ER  - 
%0 Journal Article
%A Louchard, G.
%T Exact and asymptotic distributions in digital and binary search trees
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1987
%P 479-495
%V 21
%N 4
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1987__21_4_479_0/
%G en
%F ITA_1987__21_4_479_0
Louchard, G. Exact and asymptotic distributions in digital and binary search trees. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987) no. 4, pp. 479-495. http://www.numdam.org/item/ITA_1987__21_4_479_0/

1. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, 1965, Dover Publications.

2. G. G. Brown and B. O. Shubert, On Random Binary Trees, Math. Op. Res., Vol. 9, No. 1, 1984, pp. 43-65. | MR | Zbl

3. L. Devroye, A Probabilistic Analysis of Height of Tries and of the Complexity of Triesort, Acta Informatica, Vol. 21, 1984, pp. 229-237. | MR | Zbl

4. P. Flajolet, Approximate Counting: a Detailed Analysis, BIT, Vol. 25, 1985, pp. 113-134. | MR | Zbl

5. P. Flajolet and R. Sedgewick, Digital Search Trees Revisited, S.I.A.M. J. Comp., Vol. 15, No. 3, 1986, pp. 748-767. | MR | Zbl

6. J. Françon, On the Analysis of Algorithms for Trees, Th. Comp. Sc., Vol. 4, 1977, pp. 155-169. | MR | Zbl

7. J. Françon, Arbres binaires de recherche : propriétés combinatoires et applications, RAIRO, Inf. Th.,Vol. 10, No. 12, 1986; pp. 35-50. | Numdam | Zbl

8. D. H. Greene and D. E. Knuth, Mathematics for the analysis of algorithms, 1981, Birkhäuser. | MR | Zbl

9. Ph. Jacquet and M. Regnier, Limiting Distributions for Trie Parameters, Proc. C.A.A.R 86, Lecture Notes in Comp. Sc, Vol. 214, 1986, pp. 198-210.

10. N. L. Johnson and S. Kotz, Distribution in statistics: continuous univariate distributions, 1970, Wiley. | Zbl

11. P. Kirschenhofer and H. Prodinger, Some Further Results on Digital Search Trees, Proc. I.C.A.L.R., 1986, Lect. Notes Comp. Sc., Vol. 226, pp. 177-185. | MR | Zbl

12. D. E. Knuth, The Art of Computer Programming, Vol. I, 1969, Addison-Wesley. | MR

13. D. E. Knuth, The Art of Computer Programming, Vol. III, 1973, Addison-Wesley. | MR

14. G. Louchard, The Brownian Motion: a Neglected Tool for the Complexity Analysis of Sorted Tables Manipulations, R.A.I.R.O., Inf. Th., Vol. 4, 1983, pp. 365-385. | Numdam | MR | Zbl

15. G. Louchard, Brownian Motion and Algorithms Complexity, B.I.T., Vol. 26, 1986 pp. 17-34. | MR | Zbl

16. B. Pittel, Paths in a Random Digital Tree: Limiting Distributions, Adv. Appl. Prob., Vol. 18, 1986, pp. 139-155. | MR | Zbl