Conference paper
A platform for massive agent-based simulation and its evaluation
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
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
Amarachi Blessing Mbakwe, Joy Wu, et al.
NeurIPS 2023
Conference paper
The bionic DBMS is coming, but what will it look like?
Ryan Johnson, Ippokratis Pandis
CIDR 2013
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI