Deterministic skip lists

Authors:
J. Ian Munro;Thomas Papadakis;Robert Sedgewick
Affiliations:
-;-;-
Venue:
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Year:
1992

Citing 5
Cited 26

Data structures and algorithms 3: multi-dimensional searching and computational geometry

Data structures and algorithms 3: multi-dimensional searching and computational geometry
Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Concrete mathematics: a foundation for computer science

Concrete mathematics: a foundation for computer science
Average search and update costs in skip lists

BIT
Data Structures and Their Algorithms

Data Structures and Their Algorithms

Dynamic parallel tree contraction (extended abstract)

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Biased Skip Lists

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Minimizing Makespan and Preemption Costs on a System of Uniform Machines

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Brief announcement: deterministic skipnet

Proceedings of the twenty-second annual symposium on Principles of distributed computing
The hyperring: a low-congestion deterministic data structure for distributed environments

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic SkipNet

Information Processing Letters
Proximate point searching

Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
The skip quadtree: a simple dynamic data structure for multidimensional data

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Concurrent cache-oblivious b-trees

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On the number of rectangulations of a planar point set

Journal of Combinatorial Theory Series A
Deterministic jumplists

Nordic Journal of Computing
Testing the performance of a 2D nearest point algorithm with genetic algorithm generated Gaussian distributions

Expert Systems with Applications: An International Journal
Exploring the duality between skip lists and binary search trees

ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Cache-oblivious streaming B-trees

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A practical approach to the 2D incremental nearest-point problem suitable for different point distributions

Pattern Recognition
Dynamic optimality for skip lists and B-trees

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed Approximation Algorithm for Resource Clustering

SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
A skip-list approach for efficiently processing forecasting queries

Proceedings of the VLDB Endowment
Tiara: A Self-stabilizing Deterministic Skip List

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Authenticated relational tables and authenticated skip lists

Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Skip lift: a probabilistic alternative to red-black trees

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Tiara: A self-stabilizing deterministic skip list and skip graph

Theoretical Computer Science
Poketree: a dynamically competitive data structure with good worst-case performance

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Skip lift: A probabilistic alternative to red-black trees

Journal of Discrete Algorithms
Discrepancy-sensitive dynamic fractional cascading, dominated maxima searching, and 2-D nearest neighbors in any minkowski metric

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore techniques based on the notion of a skip list to guarantee logarithmic search, insert and delete costs. The basic idea is to insist that between any pair of elements above a given height are a small number of elements of precisely that height. The desired behaviour can be achieved by either using some extra space for pointers, or by adding the constraint that the physical sizes of the nodes be exponentially increasing. The first approach leads to simpler code, whereas the second is ideally suited to a buddy system of memory allocation. Our techniques are competitive in terms of time and space with balanced tree schemes, and, we feel, inherently simpler when taken from first principles.