Cache-oblivious Matrix Multiplication
Cache-Oblivious Matrix Multiplication is a matrix multiplication algorithm designed to exploit the memory hierarchy efficiently by recursively dividing matrices into submatrices, without explicit knowledge of cache parameters, thereby achieving optimal cache complexity across all levels of a multilevel memory hierarchy.
14
Publications
1.6K
Citations
34
Authors
12
Institutions
Publications per year
2017–2026
1
14
Matteo Frigo, Charles E. Leiserson, Harald Prokop et al. · 2003 · 807 citations
Matteo Frigo, Charles E. Leiserson, Harald Prokop et al. · ACM Transactions on Algorithms · 2012 · 190 citations
An experimental comparison of cache-oblivious and cache-conscious programs
Kamen Yotov, Tom Roeder, Keshav Pingali et al. · 2007 · 87 citations
1–5 of 14
34
4
h-index
2
h-index
2
h-index
2
h-index
Massachusetts Institute of Technology, United States
2 publications · 997 citations
2
h-index
1–5 of 34
12
IBM (United States)
Armonk, United States
2 h-index
4 publications
218 citations
Georgetown University
Washington, United States
2 h-index
2 publications
47 citations
IBM Research - Austin
Austin, United States
2 h-index
4 publications
218 citations
Stony Brook University
Stony Brook, United States
2 h-index
10 publications
235 citations
University of Vienna
Vienna, Austria
1 h-index
2 publications
42 citations
Utrecht University
Utrecht, The Netherlands
1 h-index
1 publications
86 citations

Cornell University
Ithaca, United States
1 h-index
3 publications
261 citations

Imperial College London
London, United Kingdom
1 h-index
5 publications
145 citations
1–8 of 12
TALG · 1 publications · 190 citations
1
h-index
1 publications · 29 citations
1
h-index
1 publications · 64 citations
1
h-index
1 publications · 86 citations
1
h-index
1 publications · 21 citations
1
h-index
1–5