scientific article; zbMATH DE number 3468267

MaRDI QIDQ4053104zbMATH OpenFDO

Authors E. J. Schuegraf, H. S. Heaps

Publication date 1974

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99)

Cited in

(12)

• Worst-case analysis of the iterated longest fragment algorithm
• On optimal parsing for LZ78-like compressors
• The smallest grammar problem as constituents choice and minimal grammar parsing
• The fractional greedy algorithm for data compression
• Dictionary-symbolwise flexible parsing
• On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
• Dictionary-symbolwise flexible parsing
• The greedy approach to dictionary-based static text compression on a distributed system
• Bicriteria data compression
• Worst-case analysis for on-line data compression
• On-line longest fragment first parsing algorithm
• Text compression methods

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4053104)