AbstractWe consider distributional recursions which appear in the study of random binary search trees with monomials as toll functions. This extends classical parameters as the internal path length in binary search trees. As our main results we derive asymptotic expansions for the moments of the random variables under consideration as well as limit laws and properties of the densities of the limit distributions. The analysis is based on the contraction method
We consider branching random walks with binary search trees as underlying trees. We show that the oc...
In a randomly grown binary search tree (BST) of size n, any fixed pattern occurs with a frequency t...
AbstractWe analyze two bottom-up reduction algorithms over binary trees that represent replaceable d...
AbstractWe consider distributional recursions which appear in the study of random binary search tree...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
This paper studies path lengths in random binary search trees under the random permutation model. It...
Many parameters of trees are additive in the sense that they can be computed recursively from the su...
AbstractWe derive exact moments of the number of 2-protected nodes in binary search trees grown from...
Abstract We study the profile Xn,k of random search trees including binary search trees and m-ary se...
We study the profile Xn,k of random search trees including binary search trees and m-ary search tree...
For the random binary search tree with n nodes inserted the number of ancestors of the elements with...
This thesis studies the limit distribution of parameters recursively defined on trees (rooted graphs...
Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees ...
ABSTRACT. We show that an algorithmic construction of sequences of recursive trees leads to a direct...
We consider branching random walks with binary search trees as underlying trees. We show that the oc...
In a randomly grown binary search tree (BST) of size n, any fixed pattern occurs with a frequency t...
AbstractWe analyze two bottom-up reduction algorithms over binary trees that represent replaceable d...
AbstractWe consider distributional recursions which appear in the study of random binary search tree...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
This paper studies path lengths in random binary search trees under the random permutation model. It...
Many parameters of trees are additive in the sense that they can be computed recursively from the su...
AbstractWe derive exact moments of the number of 2-protected nodes in binary search trees grown from...
Abstract We study the profile Xn,k of random search trees including binary search trees and m-ary se...
We study the profile Xn,k of random search trees including binary search trees and m-ary search tree...
For the random binary search tree with n nodes inserted the number of ancestors of the elements with...
This thesis studies the limit distribution of parameters recursively defined on trees (rooted graphs...
Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees ...
ABSTRACT. We show that an algorithmic construction of sequences of recursive trees leads to a direct...
We consider branching random walks with binary search trees as underlying trees. We show that the oc...
In a randomly grown binary search tree (BST) of size n, any fixed pattern occurs with a frequency t...
AbstractWe analyze two bottom-up reduction algorithms over binary trees that represent replaceable d...
DOI
Add to ORKG