Top Tree Compression of Tries.

DOI10.4230/LIPICS.ISAAC.2019.4MaRDI QIDQ5875564zbMATH OpenOpenAlexFDO

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

Publication date 3 February 2023

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

zbMATH Keywords

pattern matchingpointer machinetop treestree compression

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Top tree compression of tries
• Fast compressed tries through path decompositions
• Fast Compressed Tries through Path Decompositions
• Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
• Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space

Cited in

(9)

• Top tree compression of tries
• The common prefix problem on trees
• c-trie++: a dynamic trie tailored for fast prefix searches
• Sensitivity of string compressors and repetitiveness measures
• Fast compressed tries through path decompositions
• Alphabet-dependent string searching with wexponential search trees
• scientific article; zbMATH DE number 4775 (Why is no real title available?)
• Compressed cache-oblivious string B-tree
• Fast Compressed Tries through Path Decompositions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875564)