Random binary trees. Algorithms, asymptotics and statistics
From MaRDI portal
Publication:2900747
Recommendations
- On the subtrees of random binary search trees
- On the subtree size profile of binary search trees
- Random binary trees: from the average case analysis to the asymptotics of distributions
- Search trees: metric aspects and strong limit theorems
- Profiles of random trees: Limit theorems for random recursive trees and binary search trees
Cited in
(17)- scientific article; zbMATH DE number 1984556 (Why is no real title available?)
- Asymptotic variance of random symmetric digital search trees
- Random ultrametric trees and applications
- Random binary trees: from the average case analysis to the asymptotics of distributions
- A note on Rémy's algorithm for generating random binary trees
- Binary search trees, recurrent properties and wave equations
- Generating random binary trees -- a survey
- Stochastic analysis of tree–like data structures
- scientific article; zbMATH DE number 2127735 (Why is no real title available?)
- On coincidences of tuples in a binary tree with random labels of vertices
- On the subtree size profile of binary search trees
- scientific article; zbMATH DE number 168426 (Why is no real title available?)
- On the subtrees of random binary search trees
- On the probability distribution of the values of binary trees
- Estimation of search tree size and approximate counting: A likelihood approach
- Profile of random exponential binary trees
- Search trees: metric aspects and strong limit theorems
This page was built for publication: Random binary trees. Algorithms, asymptotics and statistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900747)
