Cache-oblivious Search

Cache-Oblivious Search is a cache-oblivious algorithmic paradigm designed for efficient data retrieval in hierarchically structured memory systems, distinguished by its optimal performance across all levels of the memory hierarchy without explicit knowledge of hardware parameters such as block size or cache capacity.

30

Publications

1.2K

Citations

66

Authors

37

Institutions

Publications per year

2017–2026

2

Authors

66

  1. GS
    Gerth Stølting Brodal

    Aarhus University, Denmark

    8 publications · 329 citations

    8

    h-index

  2. RF
    Rolf Fagerberg

    University of Southern Denmark, Denmark

    8 publications · 329 citations

    8

    h-index

  3. MA
    Michael A. Bender

    Stony Brook University, United States

    4 publications · 133 citations

    4

    h-index

  4. LA
    Lars Arge

    Aarhus University, Denmark

    4 publications · 88 citations

    4

    h-index

  5. BC
    Bradley C. Kuszmaul

    Massachusetts Institute of Technology, United States

    3 publications · 112 citations

    3

    h-index

1–5 of 66

Venues

  1. ACM Journal of Experimental Algorithmics

    JEA · 2 publications · 53 citations

    2

    h-index

  2. BRICS Report Series

    2 publications · 62 citations

    2

    h-index

  3. ACM Transactions on Parallel Computing

    TOPC · 1 publications · 14 citations

    1

    h-index

  4. ArXiv.org

    Repository · 1 publications · 14 citations

    1

    h-index

  5. IT University Of Copenhagen (IT University of Copenhagen)

    Repository · 1 publications · 51 citations

    1

    h-index

1–5