@InProceedings{dudek_et_al:LIPIcs.CPM.2018.16, author = {Dudek, Bartlomiej and Gawrychowski, Pawel}, title = {{Slowing Down Top Trees for Better Worst-Case Compression}}, booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)}, pages = {16:1--16:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-074-3}, ISSN = {1868-8969}, year = {2018}, volume = {105}, editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.16}, URN = {urn:nbn:de:0030-drops-86920}, doi = {10.4230/LIPIcs.CPM.2018.16}, annote = {Keywords: top trees, compression, tree grammars} }