Pages that link to "Item:Q685503"
From MaRDI portal
The following pages link to Improved behaviour of tries by adaptive branching (Q685503):
Displaying 18 items.
- New trie data structures which support very fast search operations (Q794438) (← links)
- A pruned TRIE to index a sorted file and its evaluation (Q798013) (← links)
- A unifying framework for trie design heuristics (Q911258) (← links)
- On the average depth of asymmetric LC-tries (Q1044716) (← links)
- An experimental study of compression methods for dynamic tries (Q1600992) (← links)
- Some results on tries with adaptive branching. (Q1853567) (← links)
- Dynamic interpolation search revisited (Q2288214) (← links)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
- Building efficient and compact data structures for simplicial complexes (Q2408925) (← links)
- Distributed suffix trees (Q2569396) (← links)
- Analysis of random LC tries (Q2772924) (← links)
- Reduced Implicate Tries with Updates (Q3406691) (← links)
- Multiple choice tries and distributed hash tables (Q3633017) (← links)
- A Table Compression Method for Extended Aho-Corasick Automaton (Q3637345) (← links)
- Probabilistic behavior of asymmetric level compressed tries (Q5318245) (← 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)
- Sparse suffix trees (Q6184666) (← links)