Improved behaviour of tries by adaptive branching

DOI10.1016/0020-0190(93)90068-KzbMath0776.68035OpenAlexW2033740195MaRDI QIDQ685503

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

zbMATH Keywords

digital search treelevel-compressed trie

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (10)

Building efficient and compact data structures for simplicial complexes ⋮ Sparse suffix trees ⋮ Analysis of random LC tries ⋮ Dynamic interpolation search revisited ⋮ Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space ⋮ A Table Compression Method for Extended Aho-Corasick Automaton ⋮ On the average depth of asymmetric LC-tries ⋮ Distributed suffix trees ⋮ Some results on tries with adaptive branching. ⋮ Linked dynamic tries with applications to LZ-compression in sublinear time and space

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

This page was built for publication: Improved behaviour of tries by adaptive branching