Journal of the ACM Bibliography
Michael Rodeh, Vaughan R. Pratt, and Shimon Even. Linear algorithm for
data compression via string matching. Journal of the ACM,
28(1):16-24, January 1981.
[BibTeX entry]
Selected papers that cite this one
- Timothy C. Bell and Ian H. Witten. The relationship between greedy
parsing and symbolwise text compression. Journal of the
ACM, 41(4):708-724, July 1994.
- Ramesh Hariharan. Optimal parallel
suffix tree construction. Journal of Computer and System
Sciences, 55(1):44-69, August 1997.
- Ramesh Hariharan. Optimal parallel suffix
tree construction (extended abstract). In Proceedings of the
Twenty-Sixth Annual ACM Symposium on the Theory of Computing,
pages 290-299, Montréal, Québec, Canada, 23-25 May 1994.
- James A. Storer and Thomas G. Szymanski. Data compression via textural
substitution. Journal of the ACM, 29(4):928-951,
October 1982.
Shortcuts: