Top Tree Compression of Tries.

DOI10.4230/LIPIcs.ISAAC.2019.4OpenAlexW3195996870MaRDI QIDQ5875564

Philip Bille, Paweł Gawrychowski, Gad M. Landau, Inge Li Gørtz, Oren Weimann

Publication date: 3 February 2023

Full work available at URL: https://doi.org/10.4230/lipics.isaac.2019.4

zbMATH Keywords

pattern matchingtree compressionpointer machinetop trees

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

c-trie++: a dynamic trie tailored for fast prefix searches ⋮ Sensitivity of string compressors and repetitiveness measures ⋮ Top tree compression of tries

This page was built for publication: Top Tree Compression of Tries.