Concepedia

Cache-oblivious Lower Bounds

Cache-Oblivious Lower Bounds is a theoretical construct in algorithm analysis that establishes asymptotic limits on the minimum number of memory transfers required by any algorithm in the cache-oblivious model, independent of the memory hierarchy parameters, thereby providing a fundamental benchmark for evaluating the efficiency of cache-oblivious data structures and algorithms.

6

Publications

302

Citations

16

Authors

10

Institutions

Publications per year

2017–2026

0

Parents

Publications

6

Scheduling irregular parallel computations on hierarchical caches

Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons et al. · 2011 · 89 citations

, , +15

Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science - STACS 2008

Pascal Weil, Susanne Albers · HAL (Le Centre pour la Communication Scientifique Directe) · 2008 · 88 citations

, , +16

On the limits of cache-obliviousness

Gerth Stølting Brodal, Rolf Fagerberg · 2003 · 61 citations

, , +15

A unified access bound on comparison-based dynamic dictionaries

Mihai Bâdoiu, Richard Cole, Erik D. Demaine et al. · Theoretical Computer Science · 2007 · 36 citations

, , +8

A general approach for cache-oblivious range reporting and approximate range counting

Peyman Afshani, Chris Hamilton, Norbert Zeh · Computational Geometry · 2010 · 17 citations

, , +15

1–5 of 6

Authors

16

  1. NZ
    Norbert Zeh

    Dalhousie University, Canada

    2 publications · 28 citations

    2

    h-index

  2. GS
    Gerth Stølting Brodal

    Aarhus University, Denmark

    1 publications · 61 citations

    1

    h-index

  3. PW
    Pascal Weil

    Centre National de la Recherche Scientifique, France

    1 publications · 88 citations

    1

    h-index

  4. PA
    Peyman Afshani

    Aarhus University, Denmark

    1 publications · 17 citations

    1

    h-index

  5. SA
    Susanne Albers

    University of Freiburg, Germany

    1 publications · 88 citations

    1

    h-index

1–5 of 16

Institutions

10

  1. Aarhus University

    Aarhus, Denmark

    3 h-index

    4 publications

    150 citations

  2. Dalhousie University

    Halifax, Canada

    2 h-index

    3 publications

    45 citations

  3. Courant Institute of Mathematical Sciences

    New York, United States

    1 h-index

    1 publications

    36 citations

  4. New York University

    New York, United States

    1 h-index

    1 publications

    36 citations

  5. Carnegie Mellon University

    Pittsburgh, United States

    1 h-index

    3 publications

    267 citations

  6. Vassar College

    Town of Poughkeepsie, United States

    1 h-index

    2 publications

    72 citations

  7. Laboratoire Bordelais de Recherche en Informatique

    Talence, France

    1 h-index

    1 publications

    88 citations

  8. University of Freiburg

    Freiburg im Breisgau, Germany

    1 h-index

    1 publications

    88 citations

1–8 of 10

Venues

  1. Theoretical Computer Science

    1 publications · 36 citations

    1

    h-index

  2. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 1 publications · 88 citations

    1

    h-index

  3. Computational Geometry

    1 publications · 17 citations

    1

    h-index

1–3