Exact and asymptotic distributions in digital and binary search trees
Open Access
- 1 January 1987
- journal article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 21 (4), 479-495
- https://doi.org/10.1051/ita/1987210404791
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Digital Search Trees RevisitedSIAM Journal on Computing, 1986
- Paths in a random digital tree: limiting distributionsAdvances in Applied Probability, 1986
- Brownian motion and algorithm complexityBIT Numerical Mathematics, 1986
- Some further results on digital search treesLecture Notes in Computer Science, 1986
- Approximate counting: A detailed analysisBIT Numerical Mathematics, 1985
- A probabilistic analysis of the height of tries and of the complexity of triesortActa Informatica, 1984
- On Random Binary TreesMathematics of Operations Research, 1984
- The brownian motion : a neglected tool for the complexity analysis of sorted tables manipulationRAIRO. Informatique théorique, 1983
- On the analysis of algorithms for treesTheoretical Computer Science, 1977
- Arbres binaires de recherche : propriétés combinatoires et applicationsRevue française d'automatique informatique recherche opérationnelle. Informatique théorique, 1976