Reflections on Optimal and Nearly Optimal Binary Search Trees

J. Ian Munro. Reflections on Optimal and Nearly Optimal Binary Search Trees. In Susanne Albers, Helmut Alt, Stefan Näher, editors, Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday. Volume 5760 of Lecture Notes in Computer Science, pages 115-120, Springer, 2009. [doi]

@inproceedings{Munro09,
  title = {Reflections on Optimal and Nearly Optimal Binary Search Trees},
  author = {J. Ian Munro},
  year = {2009},
  doi = {10.1007/978-3-642-03456-5_7},
  url = {http://dx.doi.org/10.1007/978-3-642-03456-5_7},
  tags = {search, reflection},
  researchr = {https://researchr.org/publication/Munro09},
  cites = {0},
  citedby = {0},
  pages = {115-120},
  booktitle = {Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday},
  editor = {Susanne Albers and Helmut Alt and Stefan Näher},
  volume = {5760},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-03455-8},
}