Improved behaviour of tries by adaptive branching
From MaRDI portal
Publication:685503
Recommendations
Cites work
- scientific article; zbMATH DE number 3961005 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 194543 (Why is no real title available?)
- A guided tour of Chernoff bounds
- A note on the average depth of trees
- Digital Search Trees Revisited
- Entropy and maximal spacings for random partitions
- Laws of the iterated logarithm for order statistics of uniform spacings
- Log-logarithmic worst-case range queries are possible in space theta(N)
- New trie data structures which support very fast search operations
- On the balance property of Patricia tries: External path length viewpoint
- On the performance evaluation of extendible hashing and trie searching
- Paths in a random digital tree: limiting distributions
- Storing a sparse table
- Universal classes of hash functions
Cited in
(26)- scientific article; zbMATH DE number 1696631 (Why is no real title available?)
- Multiple choice tries and distributed hash tables
- Generalizing generalized tries
- On the average depth of asymmetric LC-tries
- A Table Compression Method for Extended Aho-Corasick Automaton
- Sparse suffix trees
- scientific article; zbMATH DE number 3894487 (Why is no real title available?)
- A unifying framework for trie design heuristics
- Distributed suffix trees
- Probabilistic behavior of asymmetric level compressed tries
- Analysis of random LC tries
- Variable-depth trie index optimization: theory and experimental results
- Some results on tries with adaptive branching.
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Sorting and searching by distribution: from generic discrimination to generic tries
- Reduced Implicate Tries with Updates
- New trie data structures which support very fast search operations
- A pruned TRIE to index a sorted file and its evaluation
- Building efficient and compact data structures for simplicial complexes
- An experimental study of compression methods for dynamic tries
- Algorithms and Data Structures
- m-Bonsai: a practical compact dynamic trie
- Multiple choice tries and distributed hash tables
- Dynamic interpolation search revisited
- Algorithms for trie compaction
This page was built for publication: Improved behaviour of tries by adaptive branching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685503)
