✦ LIBER ✦

Erratum: Weighted Leaf AVL-Trees

✍ Scribed by Vaishnavi, Vijay K.

Book ID: 118176838
Publisher: Society for Industrial and Applied Mathematics
Year: 1990
Tongue: English
Weight: 48 KB
Volume: 19
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0219039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

AVL-trees for localized search

✍ Athanasios K. Tsakalidis 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 838 KB

AVL Trees with Relaxed Balance

✍ Kim S. Larsen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 185 KB

The idea of relaxed balance is to uncouple the rebalancing in search trees from the updating in order to speed up request processing in main-memory databases. In this paper, we describe a relaxed version of AVL trees. We prove that each update gives rise to at most a logarithmic number of rebalancin

Parallel Dictionaries Using AVL Trees

✍ Muralidhar Medidi; Narsingh Deo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 91 KB

Concurrent manipulation of expanded AVL

Concurrent manipulation of expanded AVL trees

✍ Yin Zhang; Zhuoqun Xu 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 862 KB

Ranking and Unranking of AVL-Trees

✍ Li, Liwu 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 987 KB

On the correspondence between AVL trees

On the correspondence between AVL trees and brother trees

✍ Th Ottmann; H. -W. Six; D. Wood 📂 Article 📅 1979 🏛 Springer Vienna 🌐 English ⚖ 453 KB