Algorithm 444: an algorithm for extracting phrases in a space-optimal fashion
Communications of the ACM
The quadratic quotient method: a hash code eliminating secondary clustering
Communications of the ACM
PUFFT—The Purdue University fast FORTRAN translator
Communications of the ACM
Parallel algorithms for data compression
Journal of the ACM (JACM)
New algorithms for comparing symbol sequences
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
ACM Computing Surveys (CSUR)
Storing text retrieval systems on CD-ROM: compression and encryption considerations
ACM Transactions on Information Systems (TOIS)
ACM Computing Surveys (CSUR)
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
The relationship between greedy parsing and symbolwise text compression
Journal of the ACM (JACM)
A text-compression-based method for code size minimization in embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Data compression via textual substitution
Journal of the ACM (JACM)
File archival techniques using data compression
Communications of the ACM
Experiments in text file compression
Communications of the ACM
A new technique for compression and storage of data
Communications of the ACM
Algorithm 444: an algorithm for extracting phrases in a space-optimal fashion
Communications of the ACM
MPACT: microprocessor application to control-firmware translator
ACM SIGDA Newsletter
A general-purpose compression scheme for large collections
ACM Transactions on Information Systems (TOIS)
Code density optimization for embedded DSP processors using data compression techniques
ARVLSI '95 Proceedings of the 16th Conference on Advanced Research in VLSI (ARVLSI'95)
Work-Optimal Parallel Decoders for LZ2 Data Compression
DCC '00 Proceedings of the Conference on Data Compression
The macro model for data compression (Extended Abstract)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The classification of greedy algorithms
Science of Computer Programming
SASE: implementation of a compressed text search engine
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Data compression procedures utilizing the similarity of data
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
On the Generation of English Sentences
IEEE Transactions on Computers
Dictionary-symbolwise flexible parsing
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Dictionary-symbolwise flexible parsing
Journal of Discrete Algorithms
On parsing optimality for dictionary-based text compression-the Zip case
Journal of Discrete Algorithms
| Hi-index | 48.28 |
A method for saving storage space for text strings, such as compiler diagnostic messages, is described. The method relies on hand selection of a set of text strings which are common to one or more messages. These phrases are then stored only once. The storage technique gives rise to a mathematical optimization problem: determine how each message should use the available phrases to minimize its storage requirement. This problem is nontrivial when phrases which overlap exist. However, a dynamic programming algorithm is presented which solves the problem in time which grows linearly with the number of characters in the text. Algorithm 444 applies to this paper.