A note on the average depth of trees

DOI10.1007/BF02279819MaRDI QIDQ1160188zbMATH OpenOpenAlexFDO

Authors Luc Devroye

Publication date 1982

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02279819

zbMATH Keywords

average depthrandom treebinary treesuccessful search time

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Stochastic processes (60G99)

Cited in

(10)

• An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms
• Some results on tries with adaptive branching.
• Improved behaviour of tries by adaptive branching
• Analysis of random LC tries
• Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
• A note on the probabilistic analysis of patricia trees
• A probabilistic analysis of the height of tries and of the complexity of triesort
• Computing the shortest reset words of synchronizing automata
• On the average depth of asymmetric LC-tries
• On search by address computation

This page was built for publication: A note on the average depth of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1160188)