184 search results - page 1 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
COMPGEOM
2003
ACM
13 years 9 months ago
2003
ACM
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...
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE