Bounded size dictionary compression: Relaxing the LRU deletion heuristic

Sergio De Agostino. Bounded size dictionary compression: Relaxing the LRU deletion heuristic. In Jan Holub, Milan Simánek, editors, Proceedings of the Prague Stringology Conference, Prague, Czech Republic, August 29-31, 2005. pages 135-142, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, 2005.

Abstract

Abstract is missing.