scientific article; zbMATH DE number 177800
From MaRDI portal
Publication:4038677
Recommendations
Cited in
(31)- A design of a parallel dictionary using skip lists
- (Probabilistic) recurrence relations revisited
- An optimal algorithm for generating minimal perfect hash functions
- Graphs, hypergraphs and hashing
- Time-space trade-offs for longest common extensions
- Low-contention data structures
- The log-star revolution
- Efficient PRAM simulation on a distributed memory machine
- Dynamic dictionaries for multisets and counting filters with constant time operations
- Simple fast parallel hashing
- Streaming dictionary matching with mismatches
- Shared memory simulations with triple-logarithmic delay
- Universal hash functions for an infinite universe and hash trees
- Polynomial hash functions are reliable (extended abstract)
- Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
- Cuckoo hashing: Further analysis
- Various improvements to text fingerprinting
- A perfect parallel dictionary
- Predecessor on the Ultra-Wide Word RAM
- Uniform hashing in constant time and linear space
- Perfect hashing
- Direct bulk-synchronous parallel algorithms
- Dynamic dictionaries for multisets and counting filters with constant time operations
- Online algorithms on antipowers and antiperiods
- Combinatorial techniques for universal hashing
- On Universal Classes of Extremely Random Constant-Time Hash Functions
- Layered hashing algorithm for real-time systems
- Probabilistic recurrence relations revisited
- Time-Space Trade-Offs for Longest Common Extensions
- Optimal bounds for the predecessor problem and related problems
- Efficient computation of sequence mappability
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)
