Analysis of an optimized search algorithm for skip lists
- 26 June 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 144 (1-2) , 199-220
- https://doi.org/10.1016/0304-3975(94)00296-u
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Combinatorics of geometrically distributed random variables: Left-to-right maximaDiscrete Mathematics, 1996
- A design of a parallel dictionary using skip listsTheoretical Computer Science, 1996
- Mellin transforms and asymptotics: Finite differences and Rice's integralsTheoretical Computer Science, 1995
- The path length of random skip listsActa Informatica, 1994
- A Limit Theory for Random Skip ListsThe Annals of Applied Probability, 1992
- Average search and update costs in skip listsBIT Numerical Mathematics, 1992
- On a tree collision resolution algorithm in presence of captureRAIRO - Theoretical Informatics and Applications, 1992
- Skip lists: a probabilistic alternative to balanced treesCommunications of the ACM, 1990