Cache-oblivious Algorithms

Cache-Oblivious Algorithms is a class of algorithms in the domain of external memory algorithms that are designed to exploit the memory hierarchy efficiently without explicit knowledge of hardware parameters such as cache size or block length, relying instead on recursive divide-and-conquer strategies to achieve optimal cache performance across all levels of a memory hierarchy.

101

Publications

5.3K

Citations

210

Authors

74

Institutions

Publications per year

2017–2026

12

Authors

210

  1. RC
    Rezaul Chowdhury

    The University of Texas at Austin, United States

    13 publications · 441 citations

    12

    h-index

  2. VR
    Vijaya Ramachandran

    The University of Texas at Austin, United States

    10 publications · 354 citations

    10

    h-index

  3. MA
    Michael A. Bender

    Stony Brook University, United States

    9 publications · 509 citations

    9

    h-index

  4. GS
    Gerth Stølting Brodal

    Aarhus University, Denmark

    7 publications · 227 citations

    7

    h-index

  5. RF
    Rolf Fagerberg

    University of Southern Denmark, Denmark

    7 publications · 227 citations

    7

    h-index

1–5 of 210

Venues

  1. ACM Journal of Experimental Algorithmics

    JEA · 3 publications · 135 citations

    3

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 3 publications · 144 citations

    3

    h-index

  3. Bioinformatics

    2 publications · 98 citations

    2

    h-index

  4. arXiv (Cornell University)

    Repository · 2 publications · 161 citations

    2

    h-index

  5. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 2 publications · 68 citations

    2

    h-index

1–5