Minimax trees in linear time with applications
From MaRDI portal
Publication:1761500
DOI10.1016/j.ejc.2012.07.016zbMath1254.05038OpenAlexW2158036127MaRDI QIDQ1761500
Paweł Gawrychowski, Travis Gagie
Publication date: 15 November 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.016
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Coding theorems (Shannon theory) (94A24)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Dynamic Shannon coding
- Parallel recognition of complement reducible graphs and cotree construction
- Time bounds for selection
- A fast algorithm for adaptive prefix coding
- Bounding Fan-out in Logical Networks
- Worst-Case Optimal Adaptive Prefix Coding
- A Remark on Stirling's Formula
- Bounds on the redundancy of binary alphabetical codes
- A New Algorithm for Building Alphabetic Minimax Trees
- Radix Sorting with No Extra Space
- Precise Minimax Redundancy and Regret
- Alphabetic Minimax Trees
- Alphabetic Minimax Trees of Degree at Most t
- Dynamic huffman coding
- Design and analysis of dynamic Huffman codes
- The Renyi redundancy of generalized Huffman codes
- Huffman codes and self-information
- Combinatorial Merging
- Variations on a theme by Huffman
- Combinatorial Merging and Huffman's Algorithm
- Binary Trees Optimum Under Various Criteria
- Bounding the Compression Loss of the FGK Algorithm
- Restructuring ordered binary trees
- Upper and Lower Bounds on Constructing Alphabetic Binary Trees
- Algorithms – ESA 2004
- Elements of Information Theory
- A Method for the Construction of Minimum-Redundancy Codes
This page was built for publication: Minimax trees in linear time with applications
