Concepedia

Cache-efficient Skip Lists

Cache-Efficient Skip Lists is a variant of the probabilistic dictionary data structure known as a skip list that is optimized to reduce cache misses by improving spatial locality through node layout and block-based organization, thereby enhancing performance in hierarchical memory systems.

2

Publications

46

Citations

10

Authors

6

Institutions

Publications per year

2017–2026

0

Parents

Publications

2

1–2 of 2

Authors

10

  1. JZ
    Jiao Zhang

    Beijing University of Posts and Telecommunications, China

    1 publications · 16 citations

    1

    h-index

  2. HP
    Helmut Prodinger

    TU Wien, Austria

    1 publications · 30 citations

    1

    h-index

  3. TP
    Tian Pan

    Beijing University of Posts and Telecommunications, China

    1 publications · 16 citations

    1

    h-index

  4. JL
    Jiang Liu

    Beijing University of Posts and Telecommunications, China

    1 publications · 16 citations

    1

    h-index

  5. PK
    Peter Kirschenhofer

    TU Wien, Austria

    1 publications · 30 citations

    1

    h-index

1–5 of 10

Institutions

6

  1. University of Vienna

    Vienna, Austria

    1 h-index

    2 publications

    60 citations

  2. TU Wien

    Vienna, Austria

    1 h-index

    2 publications

    60 citations

  3. State Key Laboratory of Networking and Switching Technology

    Beijing, China

    1 h-index

    7 publications

    112 citations

  4. Beijing Advanced Sciences and Innovation Center

    Beijing, China

    1 h-index

    2 publications

    32 citations

  5. Universitat Politècnica de Catalunya

    Barcelona, Spain

    1 h-index

    1 publications

    30 citations

  6. Beijing University of Posts and Telecommunications

    Beijing, China

    1 h-index

    7 publications

    112 citations

1–6 of 6

Venues

  1. Theoretical Computer Science

    1 publications · 30 citations

    1

    h-index

1–1