scientific article; zbMATH DE number 140487
From MaRDI portal
Publication:4028906
Recommendations
Cited in
(23)- Skip-Splay: Toward Achieving the Unified Bound in the BST Model
- Deterministic SkipNet
- Near-entropy hotlink assignments
- Near collision attack on the Grain v1 stream cipher
- Central limit theorems for the number of records in discrete models
- Proximate point searching
- scientific article; zbMATH DE number 177545 (Why is no real title available?)
- Power balance and apportionment algorithms for the United States Congress
- Weight biased leftist trees and modified skip lists
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
- Compact Storage of Superblocks for NIPoPoW Applications
- Analysis of the expected search cost in skip lists
- Surpassing the information theoretic bound with fusion trees
- scientific article; zbMATH DE number 742983 (Why is no real title available?)
- Quasi-optimal partial order reduction
- Balanced search trees made simple
- Asymptotic properties of a leader election algorithm
- Binary search tree with vine
- Word level bitwidth reduction for unbounded hardware model checking
- Slow optimally balanced search strategies vs. cached fast uniformly balanced search strategies
- Survey of DHT topology construction techniques in virtual computing environments
- Efficient rebalancing of chromatic search trees
- A concurrent implementation of skip graphs
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 Q4028906)
