✦ LIBER ✦

Imbalance in Random Digital Trees

✍ Scribed by Hosam M. Mahmoud

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 379 KB
Volume: 11
Category: Article
ISSN: 1387-5841
DOI: 10.1007/s11009-008-9087-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distances in random digital search trees

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

Trees in random graphs

✍ P. Erdös; Z. Palka 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 183 KB

Random packings and coverings in random

Random packings and coverings in random trees

✍ A. Meir; J. W. Moon 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 265 KB

Random packings and coverings in random

Random packings and coverings in random trees

✍ A. Meir; J. W. Moon 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 48 KB

Trees in sparse random graphs

✍ W.Fernandez de la Vega 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 471 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