BibTeX record conf/automata/Mehlhorn75

download as .bib file

@inproceedings{DBLP:conf/automata/Mehlhorn75,
  author       = {Kurt Mehlhorn},
  editor       = {H. Barkhage},
  title        = {Best possible bounds for the weighted path length of optimum binary
                  search trees},
  booktitle    = {Automata Theory and Formal Languages, 2nd {GI} Conference, Kaiserslautern,
                  May 20-23, 1975},
  series       = {Lecture Notes in Computer Science},
  volume       = {33},
  pages        = {31--41},
  publisher    = {Springer},
  year         = {1975},
  url          = {https://doi.org/10.1007/3-540-07407-4\_4},
  doi          = {10.1007/3-540-07407-4\_4},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/automata/Mehlhorn75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.