Tight Bounds for Top Tree Compression.
Philip Bille|Finn Fernstrøm|Inge Li Gørtz
| Anthology ID: | DBLP:conf/spire/BilleFG17 |
|---|---|
| Volume: | String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings |
| Year: | 2017 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 97-102 |
| URL: | https://doi.org/10.1007/978-3-319-67428-5_9 |
| DOI: | https://doi.org/10.1007/978-3-319-67428-5_9 |
| DBLP: | conf/spire/BilleFG17 |
| BibTeX: |
@inproceedings{bille-2017-tight,
author = {Philip Bille and
Finn Fernstr{\o}m and
Inge Li G{\o}rtz},
editor = {Gabriele Fici and
Marinella Sciortino and
Rossano Venturini},
title = {{Tight Bounds for Top Tree Compression}},
booktitle = {{String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {10508},
pages = {97--102},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-67428-5_9},
doi = {https://doi.org/10.1007/978-3-319-67428-5_9}
}