Average search and update costs in skip lists

This publication has 7 references indexed in Scilit:

• A Limit Theory for Random Skip Lists
  The Annals of Applied Probability, 1992
• Analysis of the standard deletion algorithms in exact fit domain binary search trees
  Algorithmica, 1990
• Skip lists: a probabilistic alternative to balanced trees
  Communications of the ACM, 1990
• Average-Case Analysis of Algorithms and Data Structures
  Published by Elsevier ,1990
• Analysis of the expected search cost in skip lists
  Published by Springer Nature ,1990
• Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations
  The Computer Journal, 1989
• Randomized search trees
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989