Alphabetic minimax trees of degree atmost t
SIAM Journal on Computing
The set union problem with backtracking
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Upper and Lower Bounds on Constructing Alphabetic Binary Trees
SIAM Journal on Discrete Mathematics
Generalized Shannon Code Minimizes the Maximal Redundancy
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Restructuring ordered binary trees
Journal of Algorithms - Special issue: SODA 2000
IEEE Transactions on Computers
Minimax Trees in Linear Time with Applications
Combinatorial Algorithms
Precise minimax redundancy and regret
IEEE Transactions on Information Theory
Minimax trees in linear time with applications
European Journal of Combinatorics
Hi-index | 0.00 |
We show how to build an alphabetic minimax tree for a sequence W = w$_1$, …, w$_n$ of real weights in O(nd log log n) time, where d is the number of distinct integers ⌈wi⌉. We apply this algorithm to building an alphabetic prefix code given a sample.