Add to ORKGLet X[0 . . n - 1] and Y[0 . . m - 1] be two sorted arrays, and define the m x n matrix A by A[j][i] = X[i] + Y[j]. Frederickson and Johnson [G.N. Frederickson, D.B. Johnson. Generalized selection and ranking: Sorted matrices, SIAM J. Computing 13 (1984) 14-30] gave an efficient algorithm for selecting the kth smallest element from A. We show how to make this algorithm IO-efficient. Our cache-oblivious algorithm performs O ((m + n)/ B) IOs, where B is the block size of memory transfers
AbstractThe complexity of selection is analyzed for two sets, X + Y and matrices with sorted columns...
Cache-obliviousness is a concept first introduced by Frigo et al. in [1]. We follow their model and ...
We present a parallel algorithm running in time O(logmlog*m(logm+log(nm))) time and O(mlog(nm)) oper...
Let X[0..n-1] and Y[0..m-1] be two sorted arrays, and define the m×n matrix A by A[j][i]=X[i]+Y[j]. ...
In this paper we explore a simple and general approach for developing parallel algorithms that lead ...
Abstract This paper presents asymptotically optimal algo-rithms for rectangular matrix transpose, FF...
Data movements between different levels of the memory hierarchy (I/O-transitions, or simply I/Os) ar...
In this work, we study the cache-oblivious computation model, which is inspired by the behaviour of ...
In this thesis we introduce a cost measure to compare the cache- friendliness of different permutati...
Cache-oblivious algorithms have been advanced as a way of circumventing some of the difficulties of ...
AbstractOne of the keys to tap the full performance potential of current hardware is the optimal uti...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
AbstractLet X and Y be two sorted n-vectors and A = X + Y be an n×n matrix with sorted rows and colu...
This paper is an algorithmic engineering study of cache-oblivious sorting. We investigate by em-piri...
We introduce the cache-adaptive model, which generalizes the external-memory model to apply to envir...
AbstractThe complexity of selection is analyzed for two sets, X + Y and matrices with sorted columns...
Cache-obliviousness is a concept first introduced by Frigo et al. in [1]. We follow their model and ...
We present a parallel algorithm running in time O(logmlog*m(logm+log(nm))) time and O(mlog(nm)) oper...
Let X[0..n-1] and Y[0..m-1] be two sorted arrays, and define the m×n matrix A by A[j][i]=X[i]+Y[j]. ...
In this paper we explore a simple and general approach for developing parallel algorithms that lead ...
Abstract This paper presents asymptotically optimal algo-rithms for rectangular matrix transpose, FF...
Data movements between different levels of the memory hierarchy (I/O-transitions, or simply I/Os) ar...
In this work, we study the cache-oblivious computation model, which is inspired by the behaviour of ...
In this thesis we introduce a cost measure to compare the cache- friendliness of different permutati...
Cache-oblivious algorithms have been advanced as a way of circumventing some of the difficulties of ...
AbstractOne of the keys to tap the full performance potential of current hardware is the optimal uti...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
AbstractLet X and Y be two sorted n-vectors and A = X + Y be an n×n matrix with sorted rows and colu...
This paper is an algorithmic engineering study of cache-oblivious sorting. We investigate by em-piri...
We introduce the cache-adaptive model, which generalizes the external-memory model to apply to envir...
AbstractThe complexity of selection is analyzed for two sets, X + Y and matrices with sorted columns...
Cache-obliviousness is a concept first introduced by Frigo et al. in [1]. We follow their model and ...
We present a parallel algorithm running in time O(logmlog*m(logm+log(nm))) time and O(mlog(nm)) oper...