A New Algorithm for Building Alphabetic Minimax Trees

Authors:
Travis Gagie
Affiliations:
Department of Computer Science, University of Eastern Piedmont, 15100 Alessandria (AL), Italy. E-mail: travis@mfn.unipmn.it
Venue:
Fundamenta Informaticae - Special Issue on Stringology
Year:
2009

Citing 10
Cited 0

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
Combinatorial Merging

IEEE Transactions on Computers
Minimax Trees in Linear Time with Applications

Combinatorial Algorithms
Time bounds for selection

Journal of Computer and System Sciences
An optimal parallel minimax tree algorithm

SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
Precise minimax redundancy and regret

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.