scientific article

zbMATH Open0767.68023MaRDI QIDQ4028906FDOQ4028906

William Pugh

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

probabilistic algorithmsprobabilistic data structureskip lists

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Cited In (20)

• Skip-Splay: Toward Achieving the Unified Bound in the BST Model
• Deterministic SkipNet
• Near-entropy hotlink assignments
• Central limit theorems for the number of records in discrete models
• Proximate point searching
• Title not available (Why is that?)
• Analysis of the expected search cost in skip lists
• Compact Storage of Superblocks for NIPoPoW Applications
• An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
• Surpassing the information theoretic bound with fusion trees
• Title not available (Why is that?)
• Near Collision Attack on the Grain v1 Stream Cipher
• Balanced search trees made simple
• Quasi-optimal partial order reduction
• 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
• Asymptotic Properties of a Leader Election Algorithm

   Recommendations

• Some observations on skip-lists 👍 👎
• Title not available (Why is that?) 👍 👎
• Skip trees, an alternative data structure to skip lists in a concurrent approach 👍 👎
• Analysis of the expected search cost in skip lists 👍 👎
• Title not available (Why is that?) 👍 👎

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)