Improved behaviour of tries by adaptive branching
From MaRDI portal
Publication:685503
DOI10.1016/0020-0190(93)90068-KzbMATH Open0776.68035OpenAlexW2033740195MaRDI QIDQ685503FDOQ685503
Authors: Juan-Miguel Gracia 
Publication date: 1 December 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90068-k
Recommendations
Cites Work
- Title not available (Why is that?)
- Universal classes of hash functions
- Log-logarithmic worst-case range queries are possible in space theta(N)
- New trie data structures which support very fast search operations
- A guided tour of Chernoff bounds
- Title not available (Why is that?)
- Digital Search Trees Revisited
- Laws of the iterated logarithm for order statistics of uniform spacings
- Entropy and maximal spacings for random partitions
- Storing a sparse table
- Paths in a random digital tree: limiting distributions
- Title not available (Why is that?)
- On the balance property of Patricia tries: External path length viewpoint
- On the performance evaluation of extendible hashing and trie searching
- A note on the average depth of trees
Cited In (26)
- Some results on tries with adaptive branching.
- Algorithms and Data Structures
- Multiple choice tries and distributed hash tables
- Analysis of random LC tries
- Variable-depth trie index optimization: theory and experimental results
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
- Sparse suffix trees
- Title not available (Why is that?)
- Building efficient and compact data structures for simplicial complexes
- New trie data structures which support very fast search operations
- Generalizing generalized tries
- A Table Compression Method for Extended Aho-Corasick Automaton
- Multiple choice tries and distributed hash tables
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- m-Bonsai: a practical compact dynamic trie
- Probabilistic behavior of asymmetric level compressed tries
- Sorting and searching by distribution: from generic discrimination to generic tries
- Dynamic interpolation search revisited
- Algorithms for trie compaction
- Title not available (Why is that?)
- A unifying framework for trie design heuristics
- An experimental study of compression methods for dynamic tries
- On the average depth of asymmetric LC-tries
- Distributed suffix trees
- A pruned TRIE to index a sorted file and its evaluation
- Reduced Implicate Tries with Updates
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)
