scientific article; zbMATH DE number 742983
From MaRDI portal
Publication:4763422
Recommendations
- scientific article; zbMATH DE number 2226804
- A deterministic skip list for \(k\)-dimensional range search
- Skip lists - some results on a recent data structure
- Some observations on skip-lists
- A Simple Optimistic Skiplist Algorithm
- scientific article; zbMATH DE number 140487
- Analysis of a new skip list variant
Cited in
(20)- The CB tree: a practical concurrent self-adjusting search tree
- A deterministic skip list for \(k\)-dimensional range search
- On the search path length of random binary skip graphs
- A Simple Optimistic Skiplist Algorithm
- scientific article; zbMATH DE number 2226804 (Why is no real title available?)
- Formal verification of skiplists with arbitrary many levels
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
- Tiara: a self-stabilizing deterministic skip list and skip graph
- Defending hash tables from algorithmic complexity attacks with resource burning
- Deterministic SkipNet
- On the number of rectangulations of a planar point set
- Balanced search trees made simple
- Efficient and robust path openings using the scale-invariant rank operator
- scientific article; zbMATH DE number 140487 (Why is no real title available?)
- Skip lift: a probabilistic alternative to red-black trees
- Fair priority scheduling (FPS): a process scheduling algorithm based on skip ring data structure
- Envisioning the qualitative effects of robot manipulation actions using simulation-based projections
- Average search and update costs in skip lists
- Proximate point searching
- Skip lift: a probabilistic alternative to red-black trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763422)
