"Best possible bounds for the weighted path length of optimum binary search ..."

Kurt Mehlhorn (1975)

> Home

Details and statistics

DOI: 10.1007/3-540-07407-4_4

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/automata/Mehlhorn75
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/automata/Mehlhorn75
Kurt Mehlhorn:
Best possible bounds for the weighted path length of optimum binary search trees. Automata Theory and Formal Languages 1975: 31-41

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.