scientific article
From MaRDI portal
Publication:4038677
zbMATH Open0765.68026MaRDI QIDQ4038677FDOQ4038677
Friedhelm Meyer auf der Heide, Martin Dietzfelbinger
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Cited In (27)
- (Probabilistic) recurrence relations revisited
- Efficient computation of sequence mappability
- Probabilistic recurrence relations revisited
- Dynamic dictionaries for multisets and counting filters with constant time operations
- Polynomial hash functions are reliable
- Streaming dictionary matching with mismatches
- Graphs, hypergraphs and hashing
- The log-star revolution
- Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
- Time-Space Trade-Offs for Longest Common Extensions
- Low-contention data structures
- Simple fast parallel hashing
- Various improvements to text fingerprinting
- A perfect parallel dictionary
- An optimal algorithm for generating minimal perfect hash functions
- A design of a parallel dictionary using skip lists
- Shared memory simulations with triple-logarithmic delay
- Efficient PRAM simulation on a distributed memory machine
- Dynamic dictionaries for multisets and counting filters with constant time operations
- Predecessor on the Ultra-Wide Word RAM
- Optimal bounds for the predecessor problem and related problems
- Cuckoo hashing: Further analysis
- Direct bulk-synchronous parallel algorithms
- Combinatorial techniques for universal hashing
- Time-space trade-offs for longest common extensions
- Online algorithms on antipowers and antiperiods
- Perfect hashing
Recommendations
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 Q4038677)
