✦ LIBER ✦

Book Review: Evolution of random search trees

✍ Scribed by Aldous, David

Book ID: 118203322
Publisher: American Mathematical Society
Year: 1992
Tongue: English
Weight: 381 KB
Volume: 27
Category: Article
ISSN: 0273-0979
DOI: 10.1090/s0273-0979-1992-00314-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Profiles of Random Trees: Limit Theorems

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees

✍ Michael Fuchs; Hsien-Kuei Hwang; Ralph Neininger 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 469 KB

Distribution of Distances in Random Bina

Distribution of Distances in Random Binary Search Trees

✍ Hosam M. Mahmoud and Ralph Neininger 📂 Article 📅 2003 🏛 Institute of Mathematical Statistics 🌐 English ⚖ 447 KB

Analysis of range search for random k-d

Analysis of range search for random k-d trees

✍ Philippe Chanzy; Luc Devroye; Carlos Zamora-Cura 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 254 KB

Deletions in random binary search trees:

Deletions in random binary search trees: A story of errors

✍ Wolfgang Panny 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 276 KB

On the Variance of the Height of Random

On the Variance of the Height of Random Binary Search Trees

✍ Devroye, Luc; Reed, Bruce 📂 Article 📅 1995 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 522 KB

On the complexity of branch-and-bound se

On the complexity of branch-and-bound search for random trees

✍ Luc Devroye; Carlos Zamora-Cura 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 256 KB 👁 2 views

Let T be a b-ary tree of height n, which has independent, non-negative, n identically distributed random variables associated with each of its edges, a model previously considered by Karp, Pearl, McDiarmid, and Provan. The value of a node is the sum of all the edge values on its path to the root. Co