Split Operations
Split Operations is a procedural mechanism in skip list algorithms that identifies and separates elements during an insertion or search process by creating new levels or sublists, distinguished by its role in maintaining probabilistic balance and structural integrity across hierarchical linked layers.
48
Publications
2K
Citations
140
Authors
80
Institutions
Publications per year
2017–2026
13
Parents
48
BulkVis: a graphical viewer for Oxford nanopore bulk FAST5 files
Alexander Payne, Nadine Holmes, Vardhman K. Rakyan et al. · Bioinformatics · 2018 · 329 citations · Full text
All-hex meshing using singularity-restricted field
Yufei Li, Yang Liu, Weiwei Xu et al. · ACM Transactions on Graphics · 2012 · 151 citations
1–5 of 48
140
4
h-index
4
h-index
3
h-index
2
h-index
2
h-index
1–5 of 140
80
Duke University
Durham, United States
5 h-index
8 publications
187 citations

Indian Statistical Institute
Kolkata, India
4 h-index
7 publications
133 citations
University of Michigan
Ann Arbor, United States
2 h-index
2 publications
55 citations
Columbia University
New York, United States
2 h-index
2 publications
123 citations
Queen Mary University of London
London, United Kingdom
2 h-index
2 publications
394 citations
New York University
New York, United States
2 h-index
5 publications
114 citations
Rensselaer Polytechnic Institute
Troy, United States
2 h-index
2 publications
123 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
123 citations
1–8 of 80
2 publications · 95 citations
2
h-index
TRR · 2 publications · 66 citations
2
h-index
1 publications · 66 citations
1
h-index
1 publications · 36 citations
1
h-index
1 publications · 49 citations
1
h-index
1–5