Affiliation:
1. Univ. of Maryland, College Park
Abstract
Skip lists are data structures that use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.
Publisher
Association for Computing Machinery (ACM)
Reference10 articles.
1. Allen J. Anatomy of LISP. McGraw Hill N.Y. 1978. Allen J. Anatomy of LISP. McGraw Hill N.Y. 1978.
2. Randomized search trees
Cited by
587 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Grammar-based Pattern Matching and Type Checking for Difference Data Structures;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09
2. MTDB: an LSM-tree-based key-value store using a multi-tree structure to improve read performance;The Journal of Supercomputing;2024-08-01
3. MeMemo: On-device Retrieval Augmentation for Private and Personalized Text Generation;Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval;2024-07-10
4. Efficient Non-Blocking Event Management for Speculative Parallel Discrete Event Simulation;Proceedings of the 38th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation;2024-06-24
5. The Functional Essence of Imperative Binary Search Trees;Proceedings of the ACM on Programming Languages;2024-06-20