A note on the height of binary search trees
Journal of the ACM (JACM)
Branching processes in the analysis of the heights of trees
Acta Informatica
A note on the height of suffix trees
SIAM Journal on Computing
A generalized suffix tree and its (un)expected asymptotic behaviors
SIAM Journal on Computing
String searching algorithms
Symmetry breaking for suffix tree construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Text algorithms
A Generalization of the Suffix Tree to Square Matrices, with Applications
SIAM Journal on Computing
A comparison of imperative and purely functional suffix tree constructions
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Random Structures & Algorithms
The Suffix of a square matrix, with applications
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Optimal Logarithmic Time Randomized Suffix Tree Construction
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
A random suffix search tree is a binary search tree constructed for the suffixes Xi = 0. BiBi+1Bi+2 ... of a sequence B1, B2, B3 .... of independent identically distributed random b-ary digits Bj. Let Dn denote the depth of the node for Xn in this tree when B1 is uniform on Zb. We show that for any value of b 1, EDn = 2 log n + O(log2log n), just as for the random binary search tree. We also show that Dn/EDn → 1 in probability.