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