Optimal finger search trees in the pointer machine

Authors:
Gerth Stølting Brodal;George Lagogiannis;Christos Makris;Athanasios Tsakalidis;Kostas Tsichlas
Affiliations:
University of Aarhus;University of Patras & Computer Technology Institute, Patra, Greece;University of Patras & Computer Technology Institute, Patra, Greece;University of Patras & Computer Technology Institute, Patra, Greece;University of Patras & Computer Technology Institute, Patra, Greece
Venue:
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Year:
2002

Citing 10
Cited 3

AVL-trees for localized search

Information and Control
A balanced search tree with O(1) worst case update time

Acta Informatica
Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
A constant update time finger search tree

Information Processing Letters
Finger search trees with constant insertion time

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Tight(er) worst-case bounds on dynamic searching and priority queues

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Partially persistent data structures of bounded degree with constant update time

Nordic Journal of Computing
Localized search in sorted lists

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A new representation for linear lists

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A programming and problem-solving seminar

A programming and problem-solving seminar

New dynamic balanced search trees with worst-case constant update time

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Improving the performance of multidimensional search using fingers

Journal of Experimental Algorithmics (JEA)
Partially persistent B-trees with constant worst-case update time

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 twenty years while many attempts by researchers were made to solve it. The result comes as a consequence of the innovative mechanism that guides the rebalancing operations combined with incremental multiple splitting and fusion techniques over nodes.