Elements of information theory
Elements of information theory
Upper and Lower Bounds on Constructing Alphabetic Binary Trees
SIAM Journal on Discrete Mathematics
Protocols for asymmetric communication channels
Journal of Computer and System Sciences
Succinct Representation of Balanced Parentheses and Static Trees
SIAM Journal on Computing
Optimal Histograms with Quality Guarantees
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Optimal Alphabet Partitioning for Semi-Adaptive Coding of Sources of Unknown Sparse Distributions
DCC '03 Proceedings of the Conference on Data Compression
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
A simple upper bound on the redundancy of Huffman codes
IEEE Transactions on Information Theory
Large alphabets and incompressibility
Information Processing Letters
| Hi-index | 0.89 |