Skip lists: a probabilistic alternative to balanced trees
From MaRDI portal
Recommendations
Cited in
(25)- Word level bitwidth reduction for unbounded hardware model checking
- Surpassing the information theoretic bound with fusion trees
- Efficient rebalancing of chromatic search trees
- Quasi-optimal partial order reduction
- Deterministic SkipNet
- A concurrent implementation of skip graphs
- Near collision attack on the Grain v1 stream cipher
- Asymptotic properties of a leader election algorithm
- Skip-Splay: Toward Achieving the Unified Bound in the BST Model
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
- Compact Storage of Superblocks for NIPoPoW Applications
- Survey of DHT topology construction techniques in virtual computing environments
- The interval skip list: A data structure for finding all intervals that overlap a point
- Skip trees, an alternative data structure to skip lists in a concurrent approach
- scientific article; zbMATH DE number 742983 (Why is no real title available?)
- Binary search tree with vine
- Analysis of the expected search cost in skip lists
- Balanced search trees made simple
- Power balance and apportionment algorithms for the United States Congress
- Central limit theorems for the number of records in discrete models
- Near-entropy hotlink assignments
- Proximate point searching
- Weight biased leftist trees and modified skip lists
- Skip Lists
- Slow optimally balanced search strategies vs. cached fast uniformly balanced search strategies
This page was built for publication: Skip lists: a probabilistic alternative to balanced trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028906)
