BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC (Q3421843): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-complete problems in data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of individual sequences via variable-rate coding / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:50, 25 June 2024

scientific article
Language Label Description Also known as
English
BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC
scientific article

    Statements

    BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC (English)
    0 references
    0 references
    8 February 2007
    0 references
    LZ2 compression
    0 references
    space complexity
    0 references
    bounded dictionary
    0 references
    LRU strategy
    0 references

    Identifiers