scientific article
From MaRDI portal
Publication:4028906
zbMath0767.68023MaRDI QIDQ4028906
Publication date: 28 March 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Efficient rebalancing of chromatic search trees, Analysis of the expected search cost in skip lists, Balanced search trees made simple, An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters, Deterministic SkipNet, Survey of DHT topology construction techniques in virtual computing environments, Proximate point searching, Near Collision Attack on the Grain v1 Stream Cipher, Slow optimally balanced search strategies vs. cached fast uniformly balanced search strategies, Compact Storage of Superblocks for NIPoPoW Applications, Central limit theorems for the number of records in discrete models, Asymptotic Properties of a Leader Election Algorithm, Near-entropy hotlink assignments, Quasi-optimal partial order reduction, A Concurrent Implementation of Skip Graphs, Word level bitwidth reduction for unbounded hardware model checking