Results 251 to 260 of about 2,906,539 (296)

Universal Limit Laws for Depths in Random Trees

open access: yesSIAM Journal on Computing, 1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees.
Luc Devroye
exaly   +1 more source
Some of the next articles are maybe not open access.

Related searches:

On Random Binary Trees

Mathematics of Operations Research, 1984
A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally. A generating function for the number of nodes given
Brown, Gerald G., Shubert, Bruno O.
openaire   +2 more sources

Randomized search trees

30th Annual Symposium on Foundations of Computer Science, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seidel, Raimund, Aragon, Cecilia R.
openaire   +1 more source

On the profile of random trees

Random Structures and Algorithms, 1997
Summary: Let \(T\) be a plane rooted tree with \(n\) nodes which is regarded as family tree of a Galton-Watson branching process conditioned on the total progeny. The profile of the tree may be described by the number of nodes or the number of leaves in layer \(t\sqrt n\), respectively.
Michael Drmota, Bernhard Gittenberger
openaire   +3 more sources

On random cartesian trees

Random Structures & Algorithms, 1994
AbstractCartesian trees are binary search trees in which the nodes exhibit the heap property according to a second (priority) key. If the search key and the priority key are independent, and the trees is built based on n independent copies, Cartesian trees basically behave like ordinary random binary search trees.
openaire   +1 more source

Home - About - Disclaimer - Privacy