scientific article
From MaRDI portal
Publication:4038677
zbMath0765.68026MaRDI QIDQ4038677
Friedhelm Meyer auf der Heide, Martin Dietzfelbinger
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Efficient computation of sequence mappability ⋮ Time-Space Trade-Offs for Longest Common Extensions ⋮ Direct bulk-synchronous parallel algorithms ⋮ A design of a parallel dictionary using skip lists ⋮ Efficient PRAM simulation on a distributed memory machine ⋮ (Probabilistic) recurrence relations revisited ⋮ The log-star revolution ⋮ A perfect parallel dictionary ⋮ Perfect hashing ⋮ Probabilistic recurrence relations revisited ⋮ Various improvements to text fingerprinting ⋮ Efficient randomized incremental algorithm for the closest pair problem using Leafary trees ⋮ Shared memory simulations with triple-logarithmic delay ⋮ Graphs, hypergraphs and hashing ⋮ Low-contention data structures ⋮ Time-space trade-offs for longest common extensions ⋮ Simple fast parallel hashing ⋮ Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ An optimal algorithm for generating minimal perfect hash functions ⋮ Polynomial hash functions are reliable ⋮ Cuckoo hashing: Further analysis ⋮ Optimal bounds for the predecessor problem and related problems ⋮ Streaming dictionary matching with mismatches
This page was built for publication:
