Pages that link to "Item:Q2828185"
From MaRDI portal
The following pages link to Fast compressed tries through path decompositions (Q2828185):
Displaying 13 items.
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- PTrie: data structure for compressing and storing sets via prefix sharing (Q1675812) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Faster compressed quadtrees (Q2084740) (← links)
- c-trie++: a dynamic trie tailored for fast prefix searches (Q2672225) (← links)
- On the correctness of a lock-free compression-based elastic mechanism for a hash trie design (Q2676227) (← links)
- Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
- Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries (Q5150934) (← links)
- Fast Compressed Tries through Path Decompositions (Q5233718) (← links)
- m-Bonsai: A Practical Compact Dynamic Trie (Q5384619) (← links)
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space (Q5458854) (← links)
- Top Tree Compression of Tries. (Q5875564) (← links)
- Dynamic Path-decomposed Tries (Q6039927) (← links)