"Construction of Optimal Binary Split Trees in the Presence of Bounded ..."

James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore (1988)

> Home

Details and statistics

DOI: 10.1016/0196-6774(88)90040-5

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/HesterHL88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/HesterHL88
James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore:
Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. J. Algorithms 9(2): 245-253 (1988)

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.