Compressing probability distributions
Information Processing Letters
Compressing probability distributions
Information Processing Letters
A New Algorithm for Building Alphabetic Minimax Trees
Fundamenta Informaticae - Special Issue on Stringology
Optimal integer alphabetic trees in linear time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A New Algorithm for Building Alphabetic Minimax Trees
Fundamenta Informaticae - Special Issue on Stringology
Minimax trees in linear time with applications
European Journal of Combinatorics
| Hi-index | 0.00 |
This paper studies the long-standing open question of whether optimal alphabetic binary trees can be constructed in $o(n \lg n)$ time. We show that a class of techniques for finding optimal alphabetic trees which includes all current methods yielding $O(n \lg n)$-time algorithms are at least as hard as sorting in whatever model of computation is used. We also give $O(n)$-time algorithms for the case where all the input weights are within a constant factor of one another and when they are exponentially separated.