𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Optimal finger search trees in the point
✍ 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

Binary search trees of almost optimal he
✍ Arne Andersson; Christian Icking; Rolf Klein; Thomas Ottmann πŸ“‚ Article πŸ“… 1990 πŸ› Springer-Verlag 🌐 English βš– 739 KB