Deterministic Skip List is a type of probabilistic data structure that systematically determines the levels of nodes without randomization, thereby ensuring predictable traversal paths and worst-case performance guarantees in ordered sequence operations.
6
Publications
222
Citations
13
Authors
8
Institutions
Publications per year
2017–2026
0
Variants
1-2 Skip Lists
Parents
Publications
6
J. Ian Munro, Thomas Papadakis, Robert Sedgewick · Symposium on Discrete Algorithms · 1992 · 91 citations
Dynamic optimality for skip lists and B-trees
Prosenjit Bose, Karim Douïeb, Stefan Langerman · 2008 · 35 citations
Skip lists and probabilistic analysis of algorithms
Thomas Papadakis · 1993 · 26 citations
1–5 of 6
Authors
13
- MN
2
h-index
- CS
2
h-index
- TP
2
h-index
- AF
1
h-index
- PB
1
h-index
1–5 of 13
Institutions
8
University of Waterloo
Waterloo, Canada
2 h-index
3 publications
208 citations
Kent State University
Kent, United States
2 h-index
3 publications
81 citations
The University of Sydney
Sydney, Australia
1 h-index
3 publications
45 citations
Carleton University
Ottawa, Canada
1 h-index
1 publications
35 citations
Technical University of Munich
Munich, Germany
1 h-index
1 publications
26 citations
International Islamic University Malaysia
Kuala Lumpur, Malaysia
1 h-index
1 publications
29 citations
Paderborn University
Paderborn, Germany
1 h-index
1 publications
29 citations
Université Libre de Bruxelles
Brussels, Belgium
1 h-index
2 publications
70 citations
1–8 of 8
Venues
- Theoretical Computer Science
2 publications · 55 citations
2
h-index
- Symposium on Discrete Algorithms
Conference · 1 publications · 91 citations
1
h-index
- Concurrency and Computation Practice and Experience
1 publications · 15 citations
1
h-index
1–3