Applications of the theory of records in the study of random trees
Acta Informatica
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Poisson approximations for functionals of random trees
Proceedings of the seventh international conference on Random structures and algorithms
On convergence rates in the central limit theorems for combinatorial structures
European Journal of Combinatorics
Fundamentals of the Average Case Analysis of Particular Algorithms
Fundamentals of the Average Case Analysis of Particular Algorithms
Concrete Math
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
SIAM Journal on Computing
Distances and Finger Search in Random Binary Search Trees
SIAM Journal on Computing
The rotation correspondence is asymptotically a dilatation
Random Structures & Algorithms
Singularity analysis, Hadamard products, and tree recurrences
Journal of Computational and Applied Mathematics
Limit laws for embedded trees: Applications to the integrated superBrownian excursion
Random Structures & Algorithms
Left and Right Pathlengths in Random Binary Trees
Algorithmica
An analysis of the height of tries with random weights on the edges
Combinatorics, Probability and Computing
| Hi-index | 5.23 |
We present a detailed study of left-right-imbalance measures for random binary search trees under the random permutation model, i.e., where binary search trees are generated by random permutations of {1,2,...,n}. For random binary search trees of size n we study (i) the difference between the left and the right depth of a randomly chosen node, (ii) the difference between the left and the right depth of a specified node j=j(n), and (iii) the difference between the left and the right pathlength, and show for all three imbalance measures limiting distribution results.