Best possible bounds for the weighted path length of optimum binary search trees

Kurt Mehlhorn. Best possible bounds for the weighted path length of optimum binary search trees. In H. Barkhage, editor, Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, May 20-23, 1975. Volume 33 of Lecture Notes in Computer Science, pages 31-41, Springer, 1975.

@inproceedings{Mehlhorn75,
  title = {Best possible bounds for the weighted path length of optimum binary search trees},
  author = {Kurt Mehlhorn},
  year = {1975},
  tags = {search},
  researchr = {https://researchr.org/publication/Mehlhorn75},
  cites = {0},
  citedby = {0},
  pages = {31-41},
  booktitle = {Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, May 20-23, 1975},
  editor = {H. Barkhage},
  volume = {33},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-07407-4},
}