The path length of random skip lists

This publication has 13 references indexed in Scilit:

• Digital Search Trees Again Revisited: The Internal Path Length Perspective
  SIAM Journal on Computing, 1994
• A result in order statistics related to probabilistic counting
  Computing, 1993
• A Limit Theory for Random Skip Lists
  The Annals of Applied Probability, 1992
• Average search and update costs in skip lists
  BIT Numerical Mathematics, 1992
• Generalized Digital Trees and Their Difference—Differential Equations
  Random Structures & Algorithms, 1992
• Average-Case Analysis of Algorithms and Data Structures
  Published by Elsevier ,1990
• On the variance of the external path length in a symmetric digital trie
  Discrete Applied Mathematics, 1989
• On the balance property of Patricia tries: External path length viewpoint
  Theoretical Computer Science, 1989
• Zur Auswertung Gewisser Numerischer Reihen Mit Hilfe Modularer Funktionen
  Published by Springer Nature ,1987
• Digital Search Trees Revisited
  SIAM Journal on Computing, 1986