@InProceedings{bille_et_al:LIPIcs.ISAAC.2019.4,
author = {Bille, Philip and Gawrychowski, Pawe{\l} and G{\o}rtz, Inge Li and Landau, Gad M. and Weimann, Oren},
title = {{Top Tree Compression of Tries}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {4:1--4:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.4},
URN = {urn:nbn:de:0030-drops-115000},
doi = {10.4230/LIPIcs.ISAAC.2019.4},
annote = {Keywords: pattern matching, tree compression, top trees, pointer machine}
}