Merve Unuvar, Yurdaer Doganata, et al.
CLOUD 2014
Paper
Linear Algorithm for Data Compression via String Matching
Abstract
A linear implementation of the optimal universal data compression methods of Lempel and Ziv is described. The main tool is McCreight's algorithm for constructing suffix trees. Both bounded and unbounded memory are considered. © 1981, ACM. All rights reserved.
Related
Ankit Vishnubhotla, Charlotte Loh, et al.
NeurIPS 2023
Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006
Hannah Kim, Celia Cintas, et al.
IJCAI 2023