✦ LIBER ✦

AVL-trees for localized search

✍ Scribed by Athanasios K. Tsakalidis

Book ID: 114037743
Publisher: Elsevier Science
Year: 1985
Weight: 838 KB
Volume: 67
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(85)80034-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on "Concurrent Search and Inser

Comments on "Concurrent Search and Insertion in AVL Trees"

✍ Gottlieb, A. 📂 Article 📅 1981 🏛 IEEE 🌐 English ⚖ 222 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

Erratum: Weighted Leaf AVL-Trees

✍ Vaishnavi, Vijay K. 📂 Article 📅 1990 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 48 KB

O(1) space complexity deletion for AVL t

O(1) space complexity deletion for AVL trees

✍ Lin Chen 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Concurrent manipulation of expanded AVL

Concurrent manipulation of expanded AVL trees

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