scientific article; zbMATH DE number 2119662

zbMath1093.68593MaRDI QIDQ4828933

Abhi Shelat, Eric Lehman

Publication date: 29 November 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

data compression algorithms

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items

Sublinear algorithms for approximating string compressibility ⋮ A circuit complexity formulation of algorithmic information theory ⋮ Unified compression-based acceleration of edit-distance computation ⋮ Application of Lempel-Ziv factorization to the approximation of grammar-based compression. ⋮ Unnamed Item ⋮ Staged self-assembly and polyomino context-free grammars ⋮ Finite state complexity ⋮ Compact representations as a search strategy: compression EDAs ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ Learning grammars for architecture-specific facade parsing ⋮ One-Dimensional Staged Self-assembly ⋮ A Space-Optimal Grammar Compression. ⋮ A fully linear-time approximation algorithm for grammar-based compression ⋮ One-dimensional staged self-assembly ⋮ Finite state incompressible infinite sequences