Cache-oblivious Algorithms
Cache-Oblivious Algorithms is a class of algorithms in the domain of external memory algorithms that are designed to exploit the memory hierarchy efficiently without explicit knowledge of hardware parameters such as cache size or block length, relying instead on recursive divide-and-conquer strategies to achieve optimal cache performance across all levels of a memory hierarchy.
101
Publications
5.3K
Citations
210
Authors
74
Institutions
Publications per year
2017–2026
12
101
Matteo Frigo, Charles E. Leiserson, Harald Prokop et al. · 2003 · 807 citations
Main-memory hash joins on multi-core CPUs: Tuning to the underlying hardware
Çagri Balkesen, Jens Teubner, Gustavo Alonso et al. · 2013 · 271 citations
Matteo Frigo, Charles E. Leiserson, Harald Prokop et al. · ACM Transactions on Algorithms · 2012 · 190 citations
Cache oblivious stencil computations
Matteo Frigo, Volker Strumpen · 2005 · 185 citations
1–5 of 101
210
12
h-index
10
h-index
9
h-index
7
h-index
7
h-index
1–5 of 210
74
Stony Brook University
Stony Brook, United States
13 h-index
40 publications
1.3K citations

Aarhus University
Aarhus, Denmark
8 h-index
12 publications
369 citations
The University of Texas at Austin
Austin, United States
8 h-index
14 publications
570 citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
13 publications
966 citations
Intel (United States)
Santa Clara, United States
6 h-index
8 publications
626 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
12 publications
4K citations
IBM (United States)
Armonk, United States
4 h-index
8 publications
680 citations

University of Southern Denmark
Odense, Denmark
4 h-index
4 publications
139 citations
1–8 of 74
JEA · 3 publications · 135 citations
3
h-index
TPDS · 3 publications · 144 citations
3
h-index
2 publications · 98 citations
2
h-index
Repository · 2 publications · 161 citations
2
h-index
TVCG · 2 publications · 68 citations
2
h-index
1–5