R. Sebastian, M. Weise, et al.
ECPPM 2022
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
Conference paper
Reasoning about Noisy Sensors in the Situation Calculus
Fahiem Bacchus, Joseph Y. Halpern, et al.
IJCAI 1995
Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023
Susan L. Spraragen
International Conference on Design and Emotion 2010