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.

Abstract

Abstract is missing.