Michael Drmota On Robson's convergence and boundedness conjectures concerning the height of binary search trees. 47-70 2004 329 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/j.tcs.2004.08.003 db/journals/tcs/tcs329.html#Drmota04