Skip lists and probabilistic analysis of algorithms

Authors:
Thomas Papadakis
Affiliations:
Univ. of Waterloo, Waterloo, Ont., Canada
Venue:
Skip lists and probabilistic analysis of algorithms
Year:
1993

Citing 0
Cited 5

The binomial transform and the analysis of skip lists

Theoretical Computer Science
Range queries over skip tree graphs

Computer Communications
A new randomized data structure for the 11/2-dimensional range query problem

PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Skip lift: a probabilistic alternative to red-black trees

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Skip lift: A probabilistic alternative to red-black trees

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract