1461 search results - page 1 / 293 » The Cost of Cache-Oblivious Searching |
31
Voted
FOCS
2003
IEEE
14 years 4 months ago
2003
IEEE
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...
SWAT
2004
Springer
14 years 4 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...
ISAAC
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In this paper we present an implicit dictionary with the working set property i.e. a dictionary supporting insert(e), delete(x) and predecessor(x) in O(log n) time and se...
TCBB
2010
13 years 9 months ago
2010
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
ICS
2010
Tsinghua U.
14 years 3 months ago
2010
Tsinghua U.
We present a new cache oblivious scheme for iterative stencil computations that performs beyond system bandwidth limitations as though gigabytes of data could reside in an enormou...