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

Authors

161

  1. MA
    Michael A. Bender

    Stony Brook University, United States

    13 publications · 887 citations

    12

    h-index

  2. RF
    Rolf Fagerberg

    University of Southern Denmark, Denmark

    8 publications · 336 citations

    8

    h-index

  3. GS
    Gerth Stølting Brodal

    Aarhus University, Denmark

    8 publications · 336 citations

    8

    h-index

  4. LA
    Lars Arge

    Aarhus University, Denmark

    6 publications · 215 citations

    6

    h-index

  5. ED
    Erik D. Demaine

    Massachusetts Institute of Technology, United States

    6 publications · 517 citations

    6

    h-index

1–5 of 161

Venues

  1. Acta Informatica

    2 publications · 33 citations

    2

    h-index

  2. International Conference on Machine Learning

    Conference · 2 publications · 29 citations

    2

    h-index

  3. SIAM Journal on Computing

    2 publications · 155 citations

    2

    h-index

  4. 1

    h-index

  5. ACM Journal of Experimental Algorithmics

    JEA · 1 publications · 18 citations

    1

    h-index

1–5