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

Authors

34

  1. MF
    Matteo Frigo

    Massachusetts Institute of Technology, United States

    4 publications · 1.1K citations

    4

    h-index

  2. SM
    Samuel McCauley

    Stony Brook University, United States

    2 publications · 47 citations

    2

    h-index

  3. JT
    Jeremy T. Fineman

    Georgetown University, United States

    2 publications · 47 citations

    2

    h-index

  4. GG
    Golnaz Ghasemiesfeh

    Stony Brook University, United States

    2 publications · 47 citations

    2

    h-index

  5. CE
    Charles E. Leiserson

    Massachusetts Institute of Technology, United States

    2 publications · 997 citations

    2

    h-index

1–5 of 34

Venues

  1. ACM Transactions on Algorithms

    TALG · 1 publications · 190 citations

    1

    h-index

  2. Computer Physics Communications

    1 publications · 29 citations

    1

    h-index

  3. Linear Algebra and its Applications

    1 publications · 64 citations

    1

    h-index

  4. SIAM Journal on Scientific Computing

    1 publications · 86 citations

    1

    h-index

  5. IEEE Transactions on Big Data

    1 publications · 21 citations

    1

    h-index

1–5