A note on the height of suffix trees
SIAM Journal on Computing
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The analysis of hybrid trie structures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
File structures using hashing functions
Communications of the ACM
Randomized binary searching with tree structures
Communications of the ACM
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Laws of large numbers and tail inequalities for random tries and PATRICIA trees
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization
Proceedings of the 9th Colloquium on Automata, Languages and Programming
The left-right-imbalance of binary search trees
Theoretical Computer Science
Left and Right Pathlengths in Random Binary Trees
Algorithmica
Shedding new light on random trees
Shedding new light on random trees
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Hi-index | 0.00 |
We analyse the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . .d}. The edges receive random weights whose distribution depends upon the number of strings that visit that edge. Such a model covers the hybrid tries of de la Briandais and the TST of Bentley and Sedgewick, where the search time for a string can be decomposed as a sum of processing times for each symbol in the string. Our weighted trie model also permits one to study maximal path imbalance. In all cases, the weighted height is shown to be asymptotic to c log n in probability, where c is determined by the behaviour of the core of the trie (the part where all nodes have a full set of children) and the fringe of the trie (the part of the trie where nodes have only one child and form spaghetti-like trees). It can be found by maximizing a function that is related to the Cramér exponent of the distribution of the edge weights.