Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities

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.

Authors

James H. Hester

This author has not been identified. Look up 'James H. Hester' in Google

Daniel S. Hirschberg

This author has not been identified. Look up 'Daniel S. Hirschberg' in Google

Lawrence L. Larmore

This author has not been identified. Look up 'Lawrence L. Larmore' in Google