Optimal finger search trees in the pointer machine

Authors:
Gerth Stølting Brodal;George Lagogiannis;Christos Makris;Athanasios Tsakalidis;Kostas Tsichlas
Affiliations:
BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000 Aarhus C, Denmark;Computer Engineering and Informatics Department, University of Patras, Patras, Greece and Computer Technology Institute (CTI), P.O. Box 26500, Rio, Greece;Computer Engineering and Informatics Department, University of Patras, Patras, Greece and Computer Technology Institute (CTI), P.O. Box 26500, Rio, Greece;Computer Engineering and Informatics Department, University of Patras, Patras, Greece and Computer Technology Institute (CTI), P.O. Box 26500, Rio, Greece;Computer Engineering and Informatics Department, University of Patras, Patras, Greece and Computer Technology Institute (CTI), P.O. Box 26500, Rio, Greece
Venue:
Journal of Computer and System Sciences - STOC 2002
Year:
2003

Citing 14
Cited 7

AVL-trees for localized search

Information and Control
Sorting Jordan sequences in linear time using level-linked search trees

Information and Control
Finding the visibility graph of a simple polygon in time proportional to its size

SCG '87 Proceedings of the third annual symposium on Computational geometry
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
Data structures

Handbook of theoretical computer science (vol. A)
Biased finger trees and three-dimensional layers of maxima: (preliminary version)

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
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

Worst-case update times for fully-dynamic all-pairs shortest paths

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Design of data structures for mergeable trees

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Dynamic ordered sets with exponential search trees

Journal of the ACM (JACM)
Skip lift: a probabilistic alternative to red-black trees

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
One-Dimensional finger searching in RAM model revisited

PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Skip lift: A probabilistic alternative to red-black trees

Journal of Discrete Algorithms
Fast local searches and updates in bounded universes

Computational Geometry: Theory and Applications

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 20 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.