Analysis of the expected search cost in skip lists
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 160-172
- https://doi.org/10.1007/3-540-52846-6_86
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Analysis of the standard deletion algorithms in exact fit domain binary search treesAlgorithmica, 1990
- Skip lists: A probabilistic alternative to balanced treesPublished by Springer Nature ,1989
- Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and SimulationsThe Computer Journal, 1989
- Randomized search treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989