9 citations · 20 across the 3 of their papers we have counts for
4 papers
Leader election: A Markov chain approach
Rudolf Grübel, Klaas Hagemann
A well-studied randomized election algorithm proceeds as follows: In each round the remaining candidates each toss a coin and leave the competition if they obtain heads. Of interes…
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…
Nonparametric two-sample tests for increasing convex order
Ludwig Baringhaus, Rudolf Grübel
Given two independent samples of non-negative random variables with unknown distribution functions and , respectively, we introduce and discuss two tests for the hypothesis…
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…