Skip List Variants
A Skip List Variants is a scholarly contribution in the field of data structures that introduces or analyzes alternative formulations, augmentations, or optimizations of the classical skip list through modifications in promotion probability, level structure, balancing strategies, or concurrency mechanisms to achieve improved performance, memory efficiency, or adaptability in specific computational contexts.
5
Publications
205
Citations
14
Authors
8
Institutions
Publications per year
2017–2026
1
Parents
5
Column-oriented storage techniques for MapReduce
Avrilia Floratou, Jignesh M. Patel, Eugene J. Shekita et al. · Proceedings of the VLDB Endowment · 2011 · 127 citations
Skip lists and probabilistic analysis of algorithms
Thomas Papadakis · 1993 · 26 citations
On the Cost of Authenticated Data Structures
Roberto Tamassia, Nikos Triandopoulos · 2005 · 16 citations
1–5 of 5
14
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 14
8
Southwest University of Science and Technology
Mianyang, China
1 h-index
4 publications
60 citations
IBM (United States)
Armonk, United States
1 h-index
2 publications
254 citations
University of Wisconsin–Madison
Madison, United States
1 h-index
2 publications
254 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
26 citations
John Brown University
Siloam Springs, United States
1 h-index
2 publications
32 citations
IBM Research - Almaden
San Jose, United States
1 h-index
2 publications
254 citations
Mianyang Central Hospital
Mianyang, China
1 h-index
1 publications
15 citations
Clemson University
Clemson, United States
1 h-index
2 publications
42 citations
1–8 of 8
PVLDB · 1 publications · 127 citations
1
h-index
1 publications · 15 citations
1
h-index
1–2