Cache-oblivious Sorting
Cache-Oblivious Sorting is a sorting algorithm designed to exploit the memory hierarchy efficiently by minimizing cache misses across all levels of the cache without explicit knowledge of the cache parameters such as cache size or block size.
16
Publications
1.5K
Citations
28
Authors
17
Institutions
Publications per year
2017–2026
0
16
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
Sorting with Asymmetric Read and Write Costs
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons et al. · 2015 · 68 citations · Full text
On the limits of cache-obliviousness
Gerth Stølting Brodal, Rolf Fagerberg · 2003 · 61 citations
The input/output complexity of triangle enumeration
2014 · 59 citations · Full text
1–5 of 16
28
4
h-index
4
h-index
3
h-index
3
h-index
Massachusetts Institute of Technology, United States
2 publications · 997 citations
2
h-index
1–5 of 28
17
Georgetown University
Washington, United States
3 h-index
3 publications
115 citations

University of Pisa
Pisa, Italy
2 h-index
2 publications
39 citations

Aarhus University
Aarhus, Denmark
2 h-index
3 publications
174 citations
Stony Brook University
Stony Brook, United States
2 h-index
10 publications
235 citations

Bowdoin College
Brunswick, United States
1 h-index
2 publications
102 citations

University of Southern Denmark
Odense, Denmark
1 h-index
1 publications
52 citations

IT University of Copenhagen
Copenhagen, Denmark
1 h-index
1 publications
59 citations
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo"
Pisa, Italy
1 h-index
1 publications
19 citations
1–8 of 17
JEA · 2 publications · 103 citations
2
h-index
Repository · 1 publications · 51 citations
1
h-index
1 publications · 10 citations
1
h-index
Repository · 1 publications · 20 citations
1
h-index
TALG · 1 publications · 190 citations
1
h-index
1–5