Cache-oblivious Sorting

Cache-Oblivious Sorting is a sorting algorithm designed to exploit the memory hierarchy efficiently by minimizing cache misses across all levels of the cache without explicit knowledge of the cache parameters such as cache size or block size.

16

Publications

1.5K

Citations

28

Authors

17

Institutions

Publications per year

2017–2026

0

Authors

28

  1. RF
    Rolf Fagerberg

    University of Southern Denmark, Denmark

    4 publications · 140 citations

    4

    h-index

  2. GS
    Gerth Stølting Brodal

    Aarhus University, Denmark

    4 publications · 140 citations

    4

    h-index

  3. JT
    Jeremy T. Fineman

    Georgetown University, United States

    3 publications · 115 citations

    3

    h-index

  4. MF
    Matteo Frigo

    Massachusetts Institute of Technology, United States

    3 publications · 1K citations

    3

    h-index

  5. CE
    Charles E. Leiserson

    Massachusetts Institute of Technology, United States

    2 publications · 997 citations

    2

    h-index

1–5 of 28

Venues

  1. ACM Journal of Experimental Algorithmics

    JEA · 2 publications · 103 citations

    2

    h-index

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

    Repository · 1 publications · 51 citations

    1

    h-index

  3. BRICS Report Series

    1 publications · 10 citations

    1

    h-index

  4. IRIS Research product catalog (Sapienza University of Rome)

    Repository · 1 publications · 20 citations

    1

    h-index

  5. ACM Transactions on Algorithms

    TALG · 1 publications · 190 citations

    1

    h-index

1–5