Cache-oblivious Trees
Cache-Oblivious Trees is a class of hierarchical data structures organized in a tree layout that is optimized for cache efficiency without explicit knowledge of the cache parameters, thereby achieving asymptotically optimal performance across all levels of a memory hierarchy.
18
Publications
1.2K
Citations
40
Authors
26
Institutions
Publications per year
2017–2026
1
18
Michael A. Bender, Erik D. Demaine, Martı́n Farach-Colton · 2002 · 157 citations
Speedup Graph Processing by Graph Ordering
Hao Wei, Jeffrey Xu Yu, Can Lu et al. · 2016 · 154 citations
Cache-oblivious streaming B-trees
Michael A. Bender, Martı́n Farach-Colton, Jeremy T. Fineman et al. · 2007 · 142 citations · Full text
Michael A. Bender, Erik D. Demaine, Martı́n Farach-Colton · SIAM Journal on Computing · 2005 · 129 citations
1–5 of 18
40
6
h-index
Rutgers, The State University of New Jersey, United States
5 publications · 519 citations
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 40
26

Aarhus University
Aarhus, Denmark
5 h-index
10 publications
668 citations
Stony Brook University
Stony Brook, United States
4 h-index
7 publications
919 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
6 publications
687 citations
IIT@MIT
Cambridge, United States
2 h-index
6 publications
687 citations

University of Southern Denmark
Odense, Denmark
2 h-index
2 publications
64 citations

University of Pisa
Pisa, Italy
2 h-index
3 publications
108 citations
Centre Inria de l'Université Grenoble Alpes
Montbonnot-Saint-Martin, France
1 h-index
2 publications
20 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
1 h-index
3 publications
462 citations
1–8 of 26
1 publications · 129 citations
1
h-index
1 publications · 52 citations
1
h-index
1 publications · 47 citations
1
h-index
Conference · 1 publications · 24 citations
1
h-index
1 publications · 10 citations
1
h-index
1–5