Concepedia

Cache-oblivious Dynamic Sets

Cache-Oblivious Dynamic Sets is a cache-oblivious data structure designed to maintain an ordered set of elements under dynamic insertions and deletions while achieving optimal cache complexity without explicit knowledge of the memory hierarchy parameters.

2

Publications

92

Citations

5

Authors

2

Institutions

Publications per year

2017–2026

0

Parents

Publications

2

1–2 of 2

Authors

5

  1. JW
    Jing Wu

    Donghua University, China

    2 publications · 92 citations

    2

    h-index

  2. MA
    Michael A. Bender

    Stony Brook University, United States

    2 publications · 92 citations

    2

    h-index

  3. JI
    John Iacono

    Université Libre de Bruxelles, Belgium

    2 publications · 92 citations

    2

    h-index

  4. ZD
    Ziyang Duan

    Wayne State University, United States

    1 publications · 48 citations

    1

    h-index

  5. ZD
    Ziyang Duan

    Sungkyunkwan University, South Korea

    1 publications · 44 citations

    1

    h-index

1–5 of 5

Institutions

2

  1. State University of New York

    Albany, United States

    2 h-index

    6 publications

    276 citations

  2. Stony Brook University

    Stony Brook, United States

    1 h-index

    3 publications

    132 citations

1–2 of 2

Venues

  1. Journal of Algorithms

    1 publications · 44 citations

    1

    h-index

1–1