MFCS
2010
Springer
13 years 10 months ago
2010
Springer
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possib...