Insertion Algorithms

Insertion Algorithms is a procedural method in the context of skip lists that belongs to the class of update operations and is specifically distinguished by its role in determining the position and level at which a new node is probabilistically inserted while maintaining the structural and ordering invariants of the data structure.

111

Publications

5.9K

Citations

257

Authors

146

Institutions

Publications per year

2017–2026

17

Parents

Authors

257

  1. DE
    Dan E. Willard

    University at Albany, State University of New York, United States

    3 publications · 134 citations

    3

    h-index

  2. WS
    Weiping Shi

    Texas A&M University, United States

    3 publications · 52 citations

    3

    h-index

  3. CN
    C. N. Sze

    IBM Research - Austin, United States

    2 publications · 38 citations

    2

    h-index

  4. JG
    Jayesh Gaur

    Intel (India), India

    2 publications · 136 citations

    2

    h-index

  5. DF
    Dan Feng

    Huazhong University of Science and Technology, China

    2 publications · 31 citations

    2

    h-index

1–5 of 257

Venues

  1. Theoretical Computer Science

    4 publications · 69 citations

    4

    h-index

  2. 3

    h-index

  3. Communications of the ACM

    3 publications · 1.2K citations

    3

    h-index

  4. Computer Aided Geometric Design

    2 publications · 75 citations

    2

    h-index

  5. Information and Computation

    2 publications · 212 citations

    2

    h-index

1–5