StringologyTimes

Data Compression Conference for Stringologist

Data Compression Conference 2004

  1. Compressed Index for Dynamic Text.
  2. Adapting the Knuth-Morris-Pratt Algorithm for Pattern Matching in Huffman Encoded Texts.
  3. Merging Prediction by Partial Matching with Structural Contexts Model.
  4. Dynamic Shannon Coding.
  5. Lempel-Ziv Compression of Structured Text.

Data Compression Conference 2001

  1. Faster Approximate String Matching over Compressed Text.
  2. Pattern Matching in Huffman Encoded Texts.
  3. Space-Time Tradeoffs in the Inverse B-W Transform.

Data Compression Conference 2000

  1. Implementing the Context Tree Weighting Method for Text Compression.
  2. A New Compression Method for Compressed Matching.

Data Compression Conference 1999

  1. Offline Dictionary-Based Compression.
  2. A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression.

Data Compression Conference 1998

  1. On Optimality of Varients of the Block Sorting Compression.
  2. The Context Trees of Block Sorting Compression.
  3. Some Theory and Practice of Greedy Off-Line Textual Substitution.
  4. A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation.
  5. Multiple Pattern Matching in LZW Compressed Text.

Data Compression Conference 1996

  1. Extended Application of Suffix Trees to Data Compression.
This site is open source. Improve this page.