Michael Muller, Anna Kantosalo, et al.
CHI 2024
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
Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
Hannah Kim, Celia Cintas, et al.
IJCAI 2023
Conference paper
Risks and potentials of using EMV for internet payments
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999