Worst-Case Optimal Adaptive Prefix Coding (Q3183465): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1588487947 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0812.3306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fusion trees can be implemented with \(AC^0\) instructions only / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic ordered sets with exponential search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Shannon coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for online stable sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on a theme by Huffman / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for adaptive prefix coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic huffman coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channels which transmit letters of unequal duration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Compression Loss of the FGK Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating a canonical prefix encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line adaptive canonical prefix coding with bounded compression loss / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and analysis of dynamic Huffman codes / rank
 
Normal rank

Latest revision as of 01:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Worst-Case Optimal Adaptive Prefix Coding
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references