Shachar Don-Yehiya, Leshem Choshen, et al.
ACL 2025
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
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Conference paper
A platform for massive agent-based simulation and its evaluation
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
Kellen Cheng, Anna Lisa Gentile, et al.
EMNLP 2024