Analysis of an optimized search algorithm for skip lists

Theoretical Computer Science

Volumn 144, Issue 1-2, 1995, Pages 199-220

  Kirschenhofer, Peter ^a   Martínez, Conrado ^b   Prodinger, Helmut ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA STRUCTURES; OPTIMIZATION; PROBABILITY;

SEARCH ALGORITHM; SKIP LISTS; TOTAL SEARCH COST;

ALGORITHMS;

EID: 0029323158     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)00296-U     Document Type: Article

References (11)

1. A limit theory for random skip lists
2. Mellin transforms and asymptotics: finite differences and Rice's integrals
3. A design of a parallel dictionary using skip lists
4. The path length of random skip lists
5. Skip lists and probabilistic analysis of algorithms
6. Average search and update costs in skip lists
7. A skip list cookbook
8. Skip lists: a probabilistic alternative to balanced trees
9. On a tree collision resolution algorithm in presence of capture