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
111
Skip lists: a probabilistic alternative to balanced trees
William Pugh · Communications of the ACM · 1990 · 1.2K citations · Full text
Two algorithms for maintaining order in a list
Paul F. Dietz, Daniel D. Sleator · 1987 · 324 citations · Full text
Maintaining order in a linked list
Paul F. Dietz · 1982 · 284 citations · Full text
1–5 of 111
257
University at Albany, State University of New York, United States
3 publications · 134 citations
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 257
146
IBM (United States)
Armonk, United States
4 h-index
5 publications
148 citations
Texas A&M University
College Station, United States
4 h-index
10 publications
174 citations

University of Waterloo
Waterloo, Canada
3 h-index
4 publications
233 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
5 publications
143 citations

University of Minnesota
Minneapolis, United States
3 h-index
5 publications
118 citations
University of West Bohemia in Pilsen
Pilsen, Czechia
2 h-index
2 publications
68 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
3 publications
79 citations

Indian Institute of Technology Kanpur
Kanpur, India
2 h-index
2 publications
136 citations
1–8 of 146
4 publications · 69 citations
4
h-index
3 publications · 112 citations
3
h-index
3 publications · 1.2K citations
3
h-index
2 publications · 75 citations
2
h-index
2 publications · 212 citations
2
h-index
1–5