✦ LIBER ✦

Distances and Finger Search in Random Binary Search Trees

✍ Scribed by Devroye, Luc; Neininger, Ralph

Book ID: 118181229
Publisher: Society for Industrial and Applied Mathematics
Year: 2004
Tongue: English
Weight: 173 KB
Volume: 33
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539703424521

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Distances in random digital search trees

✍ Rafik Aguech; Nabil Lasmar; Hosam Mahmoud 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 274 KB

Patterns in random binary search trees

✍ Philippe Flajolet; Xavier Gourdon; Conrado Martínez 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB

In a randomly grown binary search tree BST of size n, any fixed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantified by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probabilit

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

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

Random Hyperplane Search Trees

✍ Devroye, Luc; King, James; McDiarmid, Colin 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 274 KB