Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable (Q538463): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-010-9267-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085603063 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60578963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Pushdown Dimension vs Lempel Ziv Information Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space complexity of approximating the frequency moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding Nesting Structure to Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Construction of Decimals Normal in the Scale of Ten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on normal numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-state dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preservation of languages by transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on preservation of languages by transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractal dimension and logarithmic loss unpredictability. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal approximations of the frequency moments of data streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of individual sequences via variable-rate coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5384978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:57, 4 July 2024

scientific article
Language Label Description Also known as
English
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
scientific article

    Statements

    Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    compression algorithms
    0 references
    plogon
    0 references
    computational complexity
    0 references
    data stream algorithms
    0 references
    Lempel-Ziv algorithm
    0 references
    pushdown compression
    0 references
    0 references
    0 references