StringologyTimes
Data Compression Conference for Stringologist
Data Compression Conference 2004
Merging Prediction by Partial Matching with Structural Contexts Model.
Adapting the Knuth-Morris-Pratt Algorithm for Pattern Matching in Huffman Encoded Texts.
Compressed Index for Dynamic Text.
Dynamic Shannon Coding.
Lempel-Ziv Compression of Structured Text.
Data Compression Conference 2001
Pattern Matching in Huffman Encoded Texts.
Space-Time Tradeoffs in the Inverse B-W Transform.
Faster Approximate String Matching over Compressed Text.
Data Compression Conference 2000
A New Compression Method for Compressed Matching.
Implementing the Context Tree Weighting Method for Text Compression.
Data Compression Conference 1999
A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression.
Offline Dictionary-Based Compression.
Data Compression Conference 1998
Some Theory and Practice of Greedy Off-Line Textual Substitution.
Multiple Pattern Matching in LZW Compressed Text.
On Optimality of Varients of the Block Sorting Compression.
The Context Trees of Block Sorting Compression.
A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation.
Data Compression Conference 1996
Extended Application of Suffix Trees to Data Compression.