Merge Operations
Merge Operations is a procedural construct in the context of skip lists that denotes the algorithmic process of combining two ordered skip lists into a single skip list while preserving the ordering invariant and probabilistic balance properties inherent to the data structure.
170
Publications
8.2K
Citations
434
Authors
226
Institutions
Publications per year
2017–2026
36
Parents
170
SMEM Algorithm for Mixture Models
Naonori Ueda, Ryohei Nakano, Zoubin Ghahramani et al. · Neural Computation · 2000 · 411 citations
Two algorithms for maintaining order in a list
Paul F. Dietz, Daniel D. Sleator · 1987 · 324 citations · Full text
1–5 of 170
434
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 434
226
University of Nebraska–Lincoln
Lincoln, United States
4 h-index
7 publications
284 citations

University of Amsterdam
Amsterdam, The Netherlands
3 h-index
4 publications
398 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
3 h-index
3 publications
397 citations
Mitre (United States)
Bedford, United States
3 h-index
5 publications
67 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
5 publications
390 citations

Imperial College London
London, United Kingdom
3 h-index
5 publications
105 citations

Huazhong University of Science and Technology
Wuhan, China
2 h-index
13 publications
478 citations
University College London
London, United Kingdom
2 h-index
4 publications
872 citations
1–8 of 226
4 publications · 191 citations
4
h-index
3 publications · 98 citations
3
h-index
3 publications · 73 citations
3
h-index
2 publications · 60 citations
2
h-index
TSE · 2 publications · 101 citations
2
h-index
1–5