11 search results - page 3 / 3 » Deletion without Rebalancing in Multiway Search Trees |
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...