Sciweavers

153
Voted
APPROX
2007
Springer
92views Algorithms» more  APPROX 2007»
15 years 12 months ago
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 popu...
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, A...