Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!rutgers!seismo!columbia!tom.columbia.edu!eppstein
From: eppstein@tom.columbia.edu.UUCP
Newsgroups: sci.crypt,comp.sys.ibm.pc,comp.sources.wanted
Subject: Need information on data compression algorithms
Message-ID: <4503@columbia.UUCP>
Date: Fri, 27-Mar-87 10:58:56 EST
Article-I.D.: columbia.4503
Posted: Fri Mar 27 10:58:56 1987
Date-Received: Sat, 28-Mar-87 13:00:58 EST
References: <318@vax1.ccs.cornell.edu> <1129@ur-tut.UUCP>
Sender: nobody@columbia.UUCP
Organization: Columbia University CS Department
Lines: 9
Xref: utgpu sci.crypt:261 comp.sys.ibm.pc:2583 comp.sources.wanted:806

Another good reference that is perhaps less well known:

Victor S. Miller and Mark N. Wegman, Variations on a theme by Ziv and Lempel,
in Combinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds),
Springer-Verlag, 1985.

References to a number of related works can be found in this paper.
-- 
David Eppstein, eppstein@cs.columbia.edu, Columbia U. Computer Science Dept.