Pages that link to "Item:Q2819506"
From MaRDI portal
The following pages link to Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (Q2819506):
Displaying 11 items.
- New trie data structures which support very fast search operations (Q794438) (← links)
- A dynamic construction algorithm for the compact Patricia trie using the hierarchical structure. (Q1395495) (← links)
- PTrie: data structure for compressing and storing sets via prefix sharing (Q1675812) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
- c-trie++: a dynamic trie tailored for fast prefix searches (Q2672225) (← links)
- (Q5005170) (← links)
- Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries (Q5150934) (← links)
- m-Bonsai: A Practical Compact Dynamic Trie (Q5384619) (← links)
- Top Tree Compression of Tries. (Q5875564) (← links)
- Dynamic Path-decomposed Tries (Q6039927) (← links)