The X-tree: An Index Structure for High
The vector class
The Union-Find Problem Kruskal`s algorithm for finding an MST
The Union of Probabilistic Boxes: Maintaining the Volume
The Tree Data Model
The Subset-Sum Problem - International Journal of Computer
The SprayList: A Scalable Relaxed Priority Queue
The SprayList: A Scalable Relaxed Priority Queue
The Specification of Array-Based Algorithms and the Automated
The Skip Quadtree: A Simple Dynamic Data Structure for
The Search Problem
The S-Linked List–A Variant Of The Linked List Data Structure
The Role of Lazy Evaluation in Amortized Data Structures
The Role of Data Structures in Multiple Disciplines of Computer
The Randomized Complexity of Maintaining the Minimum
The Random Access Zipper: Simple, Purely
The Rainbow Skip Graph: A Fault-Tolerant Constant
The R+-Tree: A Dynamic Index for Multi
The R*-tree - delab-auth
The Queue Data Structure in C
