scientific article; zbMATH DE number 1187116

MaRDI QIDQ3840319zbMATH OpenFDO

Authors József Békési, Gábor Galambos, T. Raita

Publication date 10 August 1998

zbMATH Keywords

on-line text-compression algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Greedy Algorithms for On-Line Data Compression
• scientific article; zbMATH DE number 764405
• The fractional greedy algorithm for data compression

Cited in

(7)

• Worst-case analysis of the iterated longest fragment algorithm
• Linear-time text compression by longest-first substitution
• Greedy Algorithms for On-Line Data Compression
• scientific article; zbMATH DE number 764405 (Why is no real title available?)
• Linear-time off-line text compression by longest-first substitution.
• Worst-case analysis for on-line data compression
• On-line longest fragment first parsing algorithm

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 Q3840319)