Deletion Algorithms

Deletion Algorithms is a computational method within the domain of dynamic data structures that systematically removes a specified element from a skip list while preserving the probabilistic balancing properties and maintaining ordered access across all levels of the hierarchy.

184

Publications

10.4K

Citations

368

Authors

203

Institutions

Publications per year

2017–2026

29

Parents

Authors

368

  1. TH
    Tzung‐Pei Hong

    National University of Kaohsiung, Taiwan

    6 publications · 234 citations

    6

    h-index

  2. JC
    Jerry Chun‐Wei Lin

    Western Norway University of Applied Sciences, Norway

    6 publications · 244 citations

    6

    h-index

  3. SV
    Sergey Verlan

    Université Paris-Est Créteil, France

    4 publications · 101 citations

    4

    h-index

  4. YC
    Yixin Cao

    Shanghai Jiao Tong University, China

    4 publications · 96 citations

    4

    h-index

  5. BK
    Benny Kimelfeld

    Technion – Israel Institute of Technology, Israel

    4 publications · 125 citations

    4

    h-index

1–5 of 368

Venues

  1. Theoretical Computer Science

    9 publications · 174 citations

    9

    h-index

  2. Information Processing Letters

    8 publications · 246 citations

    8

    h-index

  3. Communications of the ACM

    7 publications · 1.3K citations

    7

    h-index

  4. SIAM Journal on Computing

    6 publications · 559 citations

    6

    h-index

  5. arXiv (Cornell University)

    Repository · 5 publications · 231 citations

    5

    h-index

1–5