Journal of Algorithms
Alphabetic minimax trees of degree atmost t
SIAM Journal on Computing
Design and analysis of dynamic Huffman codes
Journal of the ACM (JACM)
Search problems
Combinatorial search
Analysis of arithmetic coding for data compression
Information Processing and Management: an International Journal - Special issue on data compression for images and texts
Upper and Lower Bounds on Constructing Alphabetic Binary Trees
SIAM Journal on Discrete Mathematics
Bounding Fan-out in Logical Networks
Journal of the ACM (JACM)
Bounding the compression loss of the FGK algorithm
Journal of Algorithms
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
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Information Processing Letters
An Efficient Implementation of Adaptive Prefix Coding
DCC '07 Proceedings of the 2007 Data Compression Conference
Combinatorial Merging and Huffman's Algorithm
IEEE Transactions on Computers
IEEE Transactions on Computers
A Fast Algorithm for Adaptive Prefix Coding
Algorithmica
Worst-Case Optimal Adaptive Prefix Coding
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A New Algorithm for Building Alphabetic Minimax Trees
Fundamenta Informaticae - Special Issue on Stringology
Journal of Computer and System Sciences
Radix sorting with no extra space
ESA'07 Proceedings of the 15th annual European conference on Algorithms
An optimal parallel minimax tree algorithm
SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
Huffman codes and self-information
IEEE Transactions on Information Theory
Variations on a theme by Huffman
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Bounds on the redundancy of binary alphabetical codes
IEEE Transactions on Information Theory
Precise minimax redundancy and regret
IEEE Transactions on Information Theory
The Renyi redundancy of generalized Huffman codes
IEEE Transactions on Information Theory - Part 1
Discrete Applied Mathematics
| Hi-index | 0.00 |
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves' depths, it minimizes the maximum of any leaf's weight plus its depth. Golumbic (1976) [20] introduced minimax trees and gave a Huffman-like, O(nlogn)-time algorithm for building them. Drmota and Szpankowski (2002) [10] gave another O(nlogn)-time algorithm, which takes linear time when the weights are already sorted by their fractional parts. In this paper we give the first linear-time algorithm for building minimax trees for unsorted real weights.