Skip lift: a probabilistic alternative to red-black trees

Authors:
Prosenjit Bose;Karim Douïeb;Pat Morin
Affiliations:
School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada
Venue:
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Year:
2010

Citing 11
Cited 0

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

Acta Informatica
Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Deterministic skip lists

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Skip lists and probabilistic analysis of algorithms

Skip lists and probabilistic analysis of algorithms
Randomized binary search trees

Journal of the ACM (JACM)
Weight-biased leftist trees and modified skip lists

Journal of Experimental Algorithmics (JEA)
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Optimal finger search trees in the pointer machine

Journal of Computer and System Sciences - STOC 2002
Dynamic optimality for skip lists and B-trees

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A dichromatic framework for balanced trees

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Rank-Balanced Trees

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the Skip lift, a randomized dictionary data structure inspired by the skip list [Pugh '90, Comm. of the ACM]. Similar to the skip list, the skip lift has the finger search property: Given a pointer to an arbitrary element f, searching for an element xtakes expected O(log δ) time where δ is the rank distance between the elements x and f. The skip lift uses nodes of O(1) worst-case size and it is one of the few efficient dictionary data structures that performs an O(1) worstcase number of structural changes during an update operation. Given a pointer to the element to be removed from the skip lift the deletion operation takes O(1) worst-case time.