Applied and computational complex analysis. Vol. 3: discrete Fourier analysis—Cauchy integrals—construction of conformal maps---univalent functions
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Tree Structures for Optimal Searching
Journal of the ACM (JACM)
Codes: Unequal Probabilities, Unequal Letter Cost
Journal of the ACM (JACM)
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Huffman coding with unequal letter costs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
An asymptotic theory for recurrence relations based on minimization and maximization
Theoretical Computer Science
DCC '01 Proceedings of the Data Compression Conference
On the cost of optimal alphabetic code trees with unequal letter costs
European Journal of Combinatorics
Binary trees with choosable edge lengths
Information Processing Letters
The structure of optimal prefix-free codes in restricted languages: the uniform probability case
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
| Hi-index | 0.01 |
Binary search trees with costs &agr; and &bgr;, respectively, on the left and right edges (lopsided search trees) are considered. The exact shape, minimum worst-case cost, and minimum average cost of lopsided trees of n internal nodes are determined for nonnegative &agr; and &bgr;; the costs are both roughly logp(n + 1) where p is the unique real number in the interval (1. 2] satisfying 1/p&agr; + 1/p&bgr; = 1. Search procedures are given that come within a small additive constant of the lower bounds. Almost-optimum algorithms for the lopsided case of unbounded searching are also obtained. Some extensions to nonconstant costs are briefly sketched.