1. Proof verification and the hardness of approximation problems;Arora;Journal of the ACM,1998
2. A locally adaptive compression scheme;Bentley;Communications of the ACM,1986
3. Linear approximation of shortest superstrings;Blum;Journal of the ACM,1994
4. M. Burrows, D. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, 1994
5. B. Chapin, S.R. Tate, Higher compression from the Burrows–Wheeler transform by modified sorting, in: Data Compression Conference, 1998, p. 532