Dynamic Perfect Hashing: Upper and Lower Bounds
From MaRDI portal
Recommendations
Cited in
(59)- Cuckoo hashing: Further analysis
- The complexity of hashing with lazy deletion
- Polynomial-time compression
- Clocked adversaries for hashing
- Exploiting storage redundancy to speed up randomized shared memory simulations
- Simulating shared memory in real time: On the computation power of reconfigurable architectures
- Min-wise independent permutations
- Fast structural alignment of biomolecules using a hash table, n-grams and string descriptors
- Validating the Knuth-Morris-Pratt failure function, fast and online
- The nearest colored node in a tree
- Union and split operations on dynamic trapezoidal maps
- Optimal bounds for the predecessor problem and related problems
- Dynamic space efficient hashing
- Succinct representation for (non)deterministic finite automata
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
- Two-dimensional packet classification and filter conflict resolution in the internet
- On the succinct representation of equivalence classes
- CuCoTrack: cuckoo filter based connection tracking
- Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem
- Authenticated hash tables based on cryptographic accumulators
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- An old sub-quadratic algorithm for finding extremal sets
- Recognizing Hamming graphs in linear time and space
- Order-preserving indexing
- Hyper-minimisation Made Efficient
- scientific article; zbMATH DE number 4209577 (Why is no real title available?)
- De Dictionariis Dynamicis Pauco Spatio Utentibus
- On the performance and cost of some PRAM models on CMP hardware
- On optimal arrangements of keys with double hashing
- scientific article; zbMATH DE number 4062630 (Why is no real title available?)
- Simple fast parallel hashing
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
- Cache-oblivious dictionaries and multimaps with negligible failure probability
- Unweighted and weighted hyper-minimization
- Stochastic analysis of dynamic processes
- Two- and three- dimensional point location in rectangular subdivisions
- Lower bounds for dynamic algorithms
- Fast computation of abelian runs
- Contracting a planar graph efficiently
- Dynamic space efficient hashing
- A space-optimal grammar compression
- Polynomial hash functions are reliable (extended abstract)
- Fast incremental planarity testing
- Type inference for first-class messages with feature constraints
- A dictionary implementation based on dynamic perfect hashing
- Two-way chaining for non-uniform distributions
- scientific article; zbMATH DE number 7765407 (Why is no real title available?)
- Universal Hashing via Integer Arithmetic Without Primes, Revisited
- Flash memory efficient LTL model checking
- On-line graph algorithms for incremental compilation
- Schema-based automata determinization
- Predecessor on the Ultra-Wide Word RAM
- Online algorithms on antipowers and antiperiods
- A simple sub-quadratic algorithm for computing the subset partial order
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- Fast local searches and updates in bounded universes
- Almost optimal exact distance oracles for planar graphs
- Adjacency queries in dynamic sparse graphs
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
This page was built for publication: Dynamic Perfect Hashing: Upper and Lower Bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305355)
