✦ LIBER ✦

Fault tolerance and storage reduction in binary search trees

✍ Scribed by J. Ian Munro; Patricio V. Poblete

Book ID: 114037701
Publisher: Elsevier Science
Year: 1984
Weight: 451 KB
Volume: 62
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(84)80035-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distributed Search Trees: Fault Toleranc

Distributed Search Trees: Fault Tolerance in an Asynchronous Environment

✍ Konrad Schlude; Eljas Soisalon-Soininen; Peter Widmayer 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 255 KB

Maximal Flow in Branching Trees and Bina

Maximal Flow in Branching Trees and Binary Search Trees

✍ Federico Bassetti; Fabrizio Leisen 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 341 KB

Distances and Finger Search in Random Bi

Distances and Finger Search in Random Binary Search Trees

✍ Devroye, Luc; Neininger, Ralph 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 173 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

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

All-fault-tolerant embedding of a comple

All-fault-tolerant embedding of a complete binary tree in a group of Cayley graphs

✍ Hsu, C.-C. 📂 Article 📅 1996 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 621 KB