Sciweavers

6 search results - page 2 / 2
» Predecessor Queries in Dynamic Integer Sets
Sort
View
COMPGEOM
2003
ACM
13 years 10 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...