@inproceedings{478ab269987940e384d59755804e8f00,
title = "Efficient algorithms for on-line symbol ranking compression",
abstract = "Symbol ranking compression algorithms are known to achieve a very good compression ratio. Off-line symbol ranking algorithms (e.g., bzip, szip) are currently the state of the art for lossless data compression because of their excellent compression/time trade-off. Some on-line symbol ranking algorithms have been proposed in the past. They compress well but their slowness make them impractical. In this paper we design some fast on-line symbol ranking algorithms by fine tuning two data structures (skip lists and ternary trees) which are well known for their simplicity and efficiency.",
author = "Giovanni Manzini",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 7th Annual European Symposium on Algorithms, ESA 1999 ; Conference date: 16-07-1999 Through 18-07-1999",
year = "1999",
doi = "10.1007/3-540-48481-7_25",
language = "English",
isbn = "3540662510",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "277--288",
editor = "Jaroslav Ne{\v s}et{\v r}il",
booktitle = "Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings",
address = "Germany",
}