Improved behaviour of tries by adaptive branching
From MaRDI portal
Publication:685503
DOI10.1016/0020-0190(93)90068-KzbMath0776.68035MaRDI QIDQ685503
Publication date: 1 December 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
Some results on tries with adaptive branching., Distributed suffix trees, Analysis of random LC tries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New trie data structures which support very fast search operations
- A guided tour of Chernoff bounds
- On the performance evaluation of extendible hashing and trie searching
- On the balance property of Patricia tries: External path length viewpoint
- Laws of the iterated logarithm for order statistics of uniform spacings
- A note on the average depth of trees
- Universal classes of hash functions
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Storing a sparse table
- Paths in a random digital tree: limiting distributions
- Digital Search Trees Revisited
- Entropy and maximal spacings for random partitions