Skip Lists

Skip Lists is a probabilistic hierarchical linked‑list-based data structure for ordered dictionaries in which elements are stored in multiple levels of forward-pointer lists formed by random promotion, thereby enabling expected \(O(\log n)\) search, insertion, and deletion while maintaining structural simplicity relative to balanced search trees.

92

Publications

8K

Citations

210

Authors

100

Institutions

Publications per year

2017–2026

16

Authors

210

  1. NS
    Nir Shavit

    Tel Aviv University, Israel

    5 publications · 279 citations

    5

    h-index

  2. TP
    Thomas Papadakis

    University of Waterloo, Canada

    3 publications · 152 citations

    3

    h-index

  3. MT
    Michael T. Goodrich

    Johns Hopkins University, United States

    3 publications · 295 citations

    3

    h-index

  4. EP
    Erez Petrank

    Technion – Israel Institute of Technology, Israel

    3 publications · 76 citations

    3

    h-index

  5. WP
    William Pugh

    University of Maryland, College Park, United States

    3 publications · 1.3K citations

    3

    h-index

1–5 of 210

Venues

  1. Theoretical Computer Science

    4 publications · 98 citations

    4

    h-index

  2. arXiv (Cornell University)

    Repository · 3 publications · 263 citations

    3

    h-index

  3. Proceedings of the VLDB Endowment

    PVLDB · 3 publications · 140 citations

    3

    h-index

  4. ACM SIGPLAN Notices

    3 publications · 95 citations

    3

    h-index

  5. BIT Numerical Mathematics

    2 publications · 45 citations

    2

    h-index

1–5