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
184
Skip lists: a probabilistic alternative to balanced trees
William Pugh · Communications of the ACM · 1990 · 1.2K citations · Full text
Bin Fan, Michael Kaminsky, Michael Mitzenmacher · 2014 · 718 citations · Full text
Repair Theory: A Generative Theory of Bugs in Procedural Skills
John Seely Brown, Kurt VanLehn · Cognitive Science · 1980 · 546 citations · Full text
Two algorithms for maintaining order in a list
Paul F. Dietz, Daniel D. Sleator · 1987 · 324 citations · Full text
1–5 of 184
368
6
h-index
Western Norway University of Applied Sciences, Norway
6 publications · 244 citations
6
h-index
4
h-index
4
h-index
4
h-index
1–5 of 368
203

National University of Kaohsiung
Kaohsiung City, Taiwan
6 h-index
10 publications
480 citations

National Sun Yat-sen University
Kaohsiung City, Taiwan
6 h-index
7 publications
282 citations
Technion – Israel Institute of Technology
Haifa, Israel
5 h-index
8 publications
523 citations

Harbin Institute of Technology
Harbin, China
5 h-index
7 publications
257 citations

Institute of Mathematical Sciences
Chennai, India
5 h-index
10 publications
576 citations
University of Bergen
Bergen, Norway
5 h-index
6 publications
277 citations

Central South University
Changsha, China
4 h-index
12 publications
211 citations

McMaster University
Hamilton, Canada
4 h-index
4 publications
95 citations
1–8 of 203
9 publications · 174 citations
9
h-index
8 publications · 246 citations
8
h-index
7 publications · 1.3K citations
7
h-index
6 publications · 559 citations
6
h-index
Repository · 5 publications · 231 citations
5
h-index
1–5