Sublinear Algorithms for Approximating String Compressibility

Sublinear Algorithms for Approximating String Compressibility

We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE) and a variant of Lempel-Ziv (LZ77), and present sublinear alg...

Full description

Bibliographic Details
Main Authors: Raskhodnikova, Sofya (Author), Ron, Dana (Author), Rubinfeld, Ronitt (Contributor), Smith, Adam (Author)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer-Verlag, 2012-10-01T17:05:04Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items