184 search results - page 1 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
159
Voted
SWAT
2004
Springer
16 years 9 days 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...
199
Voted
FOCS
2000
IEEE
15 years 11 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 ...
171
click to vote
ICALP
2003
Springer
16 years 5 days 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 ...
183
Voted
COMPGEOM
2003
ACM
16 years 7 days 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...
148
Voted
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE