Publication | Open Access
Martingales and Profile of Binary Search Trees
48
Citations
30
References
2005
Year
Mathematical ProgrammingContinuous Time ModelEngineeringRandom GraphProbabilistic Graph TheoryEntropyRandom Permutation ModelAlgorithmic Information TheoryBinary Search TreeRandomized AlgorithmBinary Search TreesComputational ComplexityTime ComplexityTree AutomatonProbability TheoryCombinatorial Optimization
We are interested in the asymptotic analysis of the binary search tree (BST) under the random permutation model. Via an embedding in a continuous time model, we get new results, in particular the asymptotic behavior of the profile.
| Year | Citations | |
|---|---|---|
Page 1
Page 1