✦ LIBER ✦

Optimal Search in Trees

✍ Scribed by Ben-Asher, Yosi; Farchi, Eitan; Newman, Ilan

Book ID: 118178216
Publisher: Society for Industrial and Applied Mathematics
Year: 1999
Tongue: English
Weight: 342 KB
Volume: 28
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s009753979731858x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nearly optimal binary search trees

✍ Kurt Mehlhorn 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 329 KB

Growing nearly optimal binary search tre

Growing nearly optimal binary search trees

✍ James F. Korsh 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 484 KB

Optimal finger search trees in the point

Optimal finger search trees in the pointer machine

✍ Gerth Stølting Brodal; George Lagogiannis; Christos Makris; Athanasios Tsakalidi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 461 KB

We develop a new finger search tree with worst-case constant update time in the pointer machine (PM) model of computation. This was a major problem in the field of Data Structures and was tantalizingly open for over 20 years, while many attempts by researchers were made to solve it. The result comes

Optimal search trees and length restrict

Optimal search trees and length restricted codes

✍ Å. Wikström 📂 Article 📅 1979 🏛 Springer Netherlands 🌐 English ⚖ 428 KB

Greedy binary search trees are nearly op

Greedy binary search trees are nearly optimal

✍ James F. Korsh 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 442 KB

Binary search trees of almost optimal he

Binary search trees of almost optimal height

✍ Arne Andersson; Christian Icking; Rolf Klein; Thomas Ottmann 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 739 KB