Abstract
Skip lists, introduced by W. Pugh., provide an alternative to search trees. The exact value of the expected search cost is derived (in terms of previously studied functions), as well as an asymptotic expression for it. The latter suggests that Pugh’s upper bound is fairly tight for the interesting cases.
Cite
CITATION STYLE
APA
Papadakis, T., Munro, J. I., & Poblete, P. V. (1990). Analysis of the expected search cost in skip lists. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 447 LNCS, pp. 160–172). Springer Verlag. https://doi.org/10.1007/3-540-52846-6_86
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free