"A Best Possible Bound for the Weighted Path Length of Binary Search Trees."

Kurt Mehlhorn (1977)

> Home

Details and statistics

DOI: 10.1137/0206017

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Mehlhorn77
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Mehlhorn77
Kurt Mehlhorn:
A Best Possible Bound for the Weighted Path Length of Binary Search Trees. SIAM J. Comput. 6(2): 235-239 (1977)

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.