Concepedia

Cache-oblivious Queues

Cache-Oblivious Queues is a data structure designed to manage ordered elements in a first-in-first-out manner while achieving optimal cache performance across all levels of a memory hierarchy without explicit knowledge of cache parameters such as size or block length.

4

Publications

181

Citations

7

Authors

6

Institutions

Publications per year

2017–2026

0

Parents

Publications

4

1–4 of 4

Authors

7

  1. LA
    Lars Arge

    Aarhus University, Denmark

    2 publications · 127 citations

    2

    h-index

  2. JI
    J. Ian Munro

    University of Waterloo, Canada

    2 publications · 127 citations

    2

    h-index

  3. MA
    Michael A. Bender

    Stony Brook University, United States

    2 publications · 127 citations

    2

    h-index

  4. BH
    Bryan Holland‐Minkley

    Duke University, United States

    2 publications · 127 citations

    2

    h-index

  5. ED
    Erik D. Demaine

    Massachusetts Institute of Technology, United States

    2 publications · 127 citations

    2

    h-index

1–5 of 7

Institutions

6

  1. University of Waterloo

    Waterloo, Canada

    1 h-index

    1 publications

    101 citations

  2. Stony Brook University

    Stony Brook, United States

    1 h-index

    1 publications

    101 citations

  3. Moscow Institute of Thermal Technology

    Moscow, Russia

    1 h-index

    1 publications

    101 citations

  4. The University of Texas at Austin

    Austin, United States

    1 h-index

    2 publications

    30 citations

  5. Massachusetts Institute of Technology

    Cambridge, United States

    1 h-index

    1 publications

    26 citations

  6. Duke University

    Durham, United States

    1 h-index

    2 publications

    202 citations

1–6 of 6

Venues

  1. SIAM Journal on Computing

    1 publications · 26 citations

    1

    h-index

1–1