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

Authors

40

  1. MA
    Michael A. Bender

    Stony Brook University, United States

    6 publications · 606 citations

    6

    h-index

  2. MF
    Martı́n Farach-Colton

    Rutgers, The State University of New Jersey, United States

    5 publications · 519 citations

    5

    h-index

  3. GS
    Gerth Stølting Brodal

    Aarhus University, Denmark

    4 publications · 254 citations

    4

    h-index

  4. RF
    Rolf Fagerberg

    University of Southern Denmark, Denmark

    4 publications · 254 citations

    4

    h-index

  5. ED
    Erik D. Demaine

    Massachusetts Institute of Technology, United States

    3 publications · 300 citations

    3

    h-index

1–5 of 40

Venues

  1. SIAM Journal on Computing

    1 publications · 129 citations

    1

    h-index

  2. BRICS Report Series

    1 publications · 52 citations

    1

    h-index

  3. Numerical Linear Algebra with Applications

    1 publications · 47 citations

    1

    h-index

  4. 1

    h-index

  5. Computers & Graphics

    1 publications · 10 citations

    1

    h-index

1–5