9 citations · 13 across the 2 of their papers we have counts for
2 papers
math.PR2009★ 4 cited
On the silhouette of binary search trees
Rudolf Grübel
A zero-one sequence describes a path through a rooted directed binary tree ; it also encodes a real number in . We regard the level of the external node of along the…
math.PR2005★ 9 cited
Mixed Poisson approximation of node depth distributions in random binary search trees
Rudolf Grubel, Nikolce Stefanoski
We investigate the distribution of the depth of a node containing a specific key or, equivalently, the number of steps needed to retrieve an item stored in a randomly grown binary…