BibTeX
@inproceedings{DBLP:conf/automata/Mehlhorn75,
author = {Kurt Mehlhorn},
title = {Best possible bounds for the weighted path length of optimum
binary search trees},
booktitle = {Automata Theory and Formal Languages},
year = {1975},
pages = {31-41},
crossref = {DBLP:conf/automata/1975},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/automata/1975,
editor = {H. Barkhage},
title = {Automata Theory and Formal Languages, 2nd GI Conference,
Kaiserslautern, May 20-23, 1975},
booktitle = {Automata Theory and Formal Languages},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {33},
year = {1975},
isbn = {3-540-07407-4},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2002-07-08 by Michael Ley (ley@uni-trier.de)