Skip Lists
Skip Lists is a probabilistic hierarchical linked‑list-based data structure for ordered dictionaries in which elements are stored in multiple levels of forward-pointer lists formed by random promotion, thereby enabling expected \(O(\log n)\) search, insertion, and deletion while maintaining structural simplicity relative to balanced search trees.
92
Publications
8K
Citations
210
Authors
100
Institutions
Publications per year
2017–2026
16
92
Skip lists: a probabilistic alternative to balanced trees
William Pugh · Communications of the ACM · 1990 · 1.2K citations · Full text
Recent directions in netlist partitioning: a survey
Charles J. Alpert, Andrew B. Kahng · Integration · 1995 · 646 citations
James Aspnes, Gauri Shah · Symposium on Discrete Algorithms · 2003 · 333 citations
James Aspnes, Gauri Shah · ACM Transactions on Algorithms · 2007 · 326 citations
1–5 of 92
210
5
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 210
100

University of Waterloo
Waterloo, Canada
5 h-index
8 publications
487 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
4 h-index
6 publications
461 citations
Technion – Israel Institute of Technology
Haifa, Israel
4 h-index
8 publications
242 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
8 publications
388 citations
Stanford University
Stanford, United States
3 h-index
9 publications
1.2K citations
University of Florida
Gainesville, United States
3 h-index
6 publications
250 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
4 publications
187 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
3 h-index
5 publications
85 citations
1–8 of 100
4 publications · 98 citations
4
h-index
Repository · 3 publications · 263 citations
3
h-index
PVLDB · 3 publications · 140 citations
3
h-index
3 publications · 95 citations
3
h-index
2 publications · 45 citations
2
h-index
1–5