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.
T. C. Hu, K. C. Tan. Least Upper Bound on the Cost of Optimum Binary Search Trees. Acta Informatica, 1:307-310, 1972.
Abstract is missing.