Mehlhorn, Kurt Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Barkhage, H. Max Planck Society;
Mehlhorn, K. (1975). Best possible bounds for the weighted path length of optimum binary search trees. In Automata Theory and Formal Languages, 2nd GI Conference (pp. 31-41). Berlin, Germany: Springer.