Three Problems about Dynamic Convex Hulls
Ch09v2.0
Indexing Structures for Files and Physical Database Design
Five Balltree Construction Algorithms
Practical lock-freedom - Cambridge Computer Lab
The following paper was originally published in the
The data structures presented so far are linear in that items are one
The Currency Handler Service
The Connection Machine - DSpace@MIT
The computation of the Bhattacharyya distance between histograms
The classification of p-compact groups and homotopical group theory
The Cambridge CAP Computer
The Buffer Tree
The BoND-tree: An Efficient Indexing Method for Box Queries in Non-ordered Discrete Data Spaces, IEEE Transactions on Data and Knowledge Engineering, 2013, Changqing Chen, Alok Watve, Sakti Pramanik, Qiang Zhu
The Batched Predecessor Problem in External Memory
The ATree: A Data Structure to Support Very Large Scientific
The ArrayList Class and File IO
The Anchors Hierarchy
The amortized cost of finding the minimum
The ADT Heap
