MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting (2000) [3 citations — 1 self]

by Kunihiko Sadakane ,  Hiroshi Imai ,  Regular Member
Add To MetaCart

Abstract:

this paper is to find them quickly.

Citations

799 A universal algorithm for sequential data compression – Ziv, Lempel - 1977
536 Text Compression – Bell, Cleary, et al. - 1990
449 Suffix arrays: a new method for on-line string searches – Manber, Myers - 1993
340 A block sorting lossless data compression algorithm – Burrows, Wheeler - 1994
135 The Art of Computer – Knuth - 1973
35 A Corpus for the Evaluation of Lossless Compression Algorithms – Arnold, Bell - 1997
20 Modifications of the Burrows and Wheeler data compression algorithm – Balkenhol, Kurtz, et al.
19 The sliding-window lempel-ziv algorithm is asymptotically optimal – Wyner, Ziv - 1994
17 The effect of non-greedy parsing in Ziv-Lempel compression methods – Horspool - 1995
16 Fast hashing of variable-length text strings – Pearson - 1990
14 Longest-match string searching for ziv-lempel compression – Bell, Kulp - 1993
7 Faster sux sorting – Larsson, Sadakane - 1999
4 Extended application of su#x trees to data compression – Larsson - 1996
2 laboratory homepage. http://www-imai.is.s.u-tokyo.ac.jp – Imai