21 search results - page 3 / 5 » Cache-Oblivious Algorithms |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Let X[0..n - 1] and Y [0..m - 1] be two sorted arrays, and define the m
ISAAC
2010
Springer
13 years 5 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...
CCCG
2007
13 years 9 months ago
2007
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
MST
2010
13 years 2 months ago
2010
We consider triply-nested loops of the type that occur in the standard Gaussian elimination algorithm, which we denote by GEP (or the Gaussian Elimination Paradigm). We present tw...