Cache-oblivious Dynamic Arrays

Cache-Oblivious Dynamic Arrays is a dynamic array data structure designed to achieve optimal cache efficiency in external memory models without explicit knowledge of cache parameters, by recursively subdividing arrays and leveraging cache-oblivious algorithms to minimize memory transfers during insertion, deletion, and access operations.

1

Publications

42

Citations

3

Authors

2

Institutions

Publications per year

2017–2026

0

Authors

3

  1. YL
    Yi Lu

    University of Illinois Urbana-Champaign, United States

    1 publications · 42 citations

    1

    h-index

  2. FB
    Flavio Bonomi

    Cisco Systems (United States), United States

    1 publications · 42 citations

    1

    h-index

  3. BP
    Balaji Prabhakar

    Stanford University, United States

    1 publications · 42 citations

    1

    h-index

1–3 of 3

Institutions

2

  1. Stanford University

    Stanford, United States

    1 h-index

    2 publications

    84 citations

  2. Cisco Systems (United States)

    San Jose, United States

    1 h-index

    1 publications

    42 citations

1–2 of 2

Venues

  1. Allerton Conference on Communication, Control, and Computing

    Conference · 1 publications · 42 citations

    1

    h-index

1–1