Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Kurt Mehlhorn. A Best Possible Bound for the Weighted Path Length of Binary Search Trees. SIAM Journal on Computing, 6(2):235-239, 1977.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Best possible bounds for the weighted path length of optimum binary search treesKurt Mehlhorn. automata 1975: 31-41
The following publications are possibly variants of this publication: