On the median-of-K version of Hoare's selection algorithm. - Rudolf Grübel (RAIRO Theor. Informatics Appl., 1999)

On the number of iterations required by Von Neumann addition. - Rudolf Grübel; Anke Reimers (RAIRO Theor. Informatics Appl., 2001)

Gaps in discrete random samples: extended abstract. - Rudolf Grübel; Pawel Hitczenko (Electron. Notes Discret. Math., 2009)

On the Subtree Size Profile of Binary Search trees. - Florian Dennert; Rudolf Grübel (Comb. Probab. Comput., 2010)

Pruned Discrete Random Samples. - Rudolf Grübel; Pawel Hitczenko (J. Appl. Probab., 2013)

Persisting randomness in randomly growing discrete structures: graphs and search trees. - Rudolf Grübel (Discret. Math. Theor. Comput. Sci., 2015)

A note on limits of sequences of binary trees. - Rudolf Grübel (Discret. Math. Theor. Comput. Sci., 2023)