Analysis of the space of search trees under the random insertion algorithm
From MaRDI portal
Recommendations
- Analysis of range search for random \(k-d\) trees
- Randomized search trees
- On the joint distribution of the insertion path length and the number of comparisons in search trees
- scientific article; zbMATH DE number 1984548
- A probabilistic analysis of some tree algorithms
- On the Generation of Random Binary Search Trees
- Random Trees and the Analysis of Branch and Bound Procedures
- Randomization of search trees by subtree size
- scientific article; zbMATH DE number 1334602
Cited in
(29)- Renewals for exponentially increasing lifetimes, with an application to digital search trees
- Average-case analysis on simple families of trees using a balanced probability model
- The total path length of split trees
- Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates
- The critical beta-splitting random tree. I: Heights and related results
- Balancing \(m\)-ary search trees with compressions on the fringe
- Certain Occupancy Numbers Via an Algorithm for Computing Their Ratios
- A general limit theorem for recursive algorithms and combinatorial structures
- Degree profile of m-ary search trees: a vehicle for data structure compression
- On the joint distribution of the insertion path length and the number of comparisons in search trees
- Probabilistic analysis of bucket recursive trees
- Normal convergence problem? Two moments and a recurrence may be the clues
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
- The fluctuations of the giant cluster for percolation on random split trees
- Inversions in split trees and conditional Galton-Watson trees
- A weakly 1-stable distribution for the number of random records and cuttings in split trees
- Multiway trees of maximum and minimum probability under the random permutation model
- Quad-k d trees: a general framework for k d trees and quad trees
- Dependence and phase changes in random m-ary search trees
- Phase changes in random m-ary search trees and generalized quicksort
- (Un)expected path lengths of asymmetric binary search trees
- scientific article; zbMATH DE number 3856447 (Why is no real title available?)
- The Joint Distribution of Elastic Buckets in Multiway Search Trees
- Page usage in a quadtree index
- A generator of heavy-tailed search trees
- Refined asymptotics for the number of leaves of random point quadtrees
- The size of random fragmentation trees
This page was built for publication: Analysis of the space of search trees under the random insertion algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4203825)