Cache-oblivious Data Structures
Cache-Oblivious Data Structures is a data structure designed to exploit the memory hierarchy efficiently by minimizing cache misses without explicit knowledge of the cache parameters such as cache size or block size.
73
Publications
4.1K
Citations
161
Authors
89
Institutions
Publications per year
2017–2026
3
Parents
73
M. Mitzenmacher · IEEE/ACM Transactions on Networking · 2002 · 524 citations
SPLATT: Efficient and Parallel Sparse Tensor-Matrix Multiplication
Shaden Smith, Niranjay Ravindran, Nicholas D. Sidiropoulos et al. · 2015 · 218 citations · Full text
Michael Mitzenmacher · 2001 · 200 citations
1–5 of 73
161
12
h-index
8
h-index
8
h-index
6
h-index
6
h-index
1–5 of 161
89
Stony Brook University
Stony Brook, United States
11 h-index
22 publications
1.4K citations

Aarhus University
Aarhus, Denmark
9 h-index
17 publications
821 citations

University of Southern Denmark
Odense, Denmark
5 h-index
8 publications
162 citations
State University of New York
Albany, United States
5 h-index
14 publications
896 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
9 publications
823 citations

University of Waterloo
Waterloo, Canada
5 h-index
6 publications
336 citations

University of Pisa
Pisa, Italy
4 h-index
6 publications
227 citations
Technical University of Munich
Munich, Germany
3 h-index
7 publications
299 citations
1–8 of 89
2 publications · 33 citations
2
h-index
Conference · 2 publications · 29 citations
2
h-index
2 publications · 155 citations
2
h-index
Repository · 1 publications · 39 citations
1
h-index
JEA · 1 publications · 18 citations
1
h-index
1–5