PRAM algorithms for static dictionary compression

Parallel algorithms for lossless data compression via dictionary compression using the longest fragment first (LFF) and greedy parsing strategies are described. Dictionary compression removes redundancy by replacing substrings of the input by references to strings stored in a dictionary. Given a static dictionary stored as a suffix tree, we present PRAM CREW algorithms for LFF compression which run in O(log/sup 2/ n) time with O(n/log n) processors where it is assumed that the maximum dictionary entry is of length O(log n). We also describe a logarithmic time and linear processor algorithm for greedy parsing.<
>