article · 2005

Applications of Steins method in the analysis of random binary search trees. Steins method and Applications

Luc Devroye

Cited by 0Abstract and details only

Abstract

Abstract. Under certain conditions, sums of functions of subtrees of a random binary search tree are asymptotically normal. We show how Stein’s method can be applied to study these random trees, and survey methods for obtaining limit laws for such functions of subtrees.

Cite this paper

APA 7

Devroye, L. (2005). Applications of Steins method in the analysis of random binary search trees. Steins method and Applications.

MLA 9

Devroye, Luc. “Applications of Steins method in the analysis of random binary search trees. Steins method and Applications.” 2005.

Chicago

Devroye, Luc. 2005. “Applications of Steins method in the analysis of random binary search trees. Steins method and Applications.”

Harvard

Devroye, L. (2005) ‘Applications of Steins method in the analysis of random binary search trees. Steins method and Applications’.

BibTeX

@article{devroye2005applications,
  title = {{Applications of Steins method in the analysis of random binary search trees. Steins method and Applications}},
  author = {Devroye, Luc},
  year = {2005}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.