%0 Journal Article %1 journals/siamcomp/Mehlhorn77 %A Mehlhorn, Kurt %D 1977 %J SIAM J. Comput. %K dblp %N 2 %P 235-239 %T A Best Possible Bound for the Weighted Path Length of Binary Search Trees. %U http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp6.html#Mehlhorn77 %V 6

@article{journals/siamcomp/Mehlhorn77, added-at = {2011-02-01T00:00:00.000+0100}, author = {Mehlhorn, Kurt}, biburl = {https://www.bibsonomy.org/bibtex/24e33e236077f8902e9ebebdc317bf8ee/dblp}, ee = {http://dx.doi.org/10.1137/0206017}, interhash = {410d8ca12db449f690918e33900c5b4e}, intrahash = {4e33e236077f8902e9ebebdc317bf8ee}, journal = {SIAM J. Comput.}, keywords = {dblp}, number = 2, pages = {235-239}, timestamp = {2011-04-29T15:08:12.000+0200}, title = {A Best Possible Bound for the Weighted Path Length of Binary Search Trees.}, url = {http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp6.html#Mehlhorn77}, volume = 6, year = 1977 }