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.

@inproceedings{Agostino05:0,
  title = {Bounded size dictionary compression: Relaxing the LRU deletion heuristic},
  author = {Sergio De Agostino},
  year = {2005},
  researchr = {https://researchr.org/publication/Agostino05%3A0},
  cites = {0},
  citedby = {0},
  pages = {135-142},
  booktitle = {Proceedings of the Prague Stringology Conference, Prague, Czech Republic, August 29-31, 2005},
  editor = {Jan Holub and Milan Simánek},
  publisher = {Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University},
  isbn = {80-01-03307-4},
}