Skip lists: A probabilistic alternative to balanced trees
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 437-449
- https://doi.org/10.1007/3-540-51542-9_36
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Incremental computation via function cachingPublished by Association for Computing Machinery (ACM) ,1989
- Self-adjusting binary search treesJournal of the ACM, 1985