"Least Upper Bound on the Cost of Optimum Binary Search Trees."

T. C. Hu, Kay Chen Tan (1972)

> Home

Details and statistics

DOI: 10.1007/BF00289510

access: closed

type: Journal Article

metadata version: 2024-10-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/acta/HuT72
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/acta/HuT72
T. C. Hu, Kay Chen Tan:
Least Upper Bound on the Cost of Optimum Binary Search Trees. Acta Informatica 1: 307-310 (1972)

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.