Collections of Functions for Perfect Hashing
From MaRDI portal
Recommendations
Cited in
(21)- Key-To-Address Transformation Techniques
- Parameterized hash functions
- Space/time trade-offs in hash coding with allowable errors
- Computing the probability of hash table/urn overflow
- scientific article; zbMATH DE number 2112400 (Why is no real title available?)
- Hash table reorganization
- Two results on tables
- Polynomial hash functions are reliable (extended abstract)
- A refinement of a compression-oriented addressing scheme
- Perfect hashing schemes for mining traversal patterns
- scientific article; zbMATH DE number 2065606 (Why is no real title available?)
- A note on hashing functions and tabu search algorithms
- The effect of table expansion on the program complexity of perfect hash functions
- A practical method for implementing string pattern matching machines
- A new practical algorithm for the construction of a perfect hash function
- A backtracking method for constructing perfect hash functions from a set of mapping functions
- An algorithm for dynamic processing of dawg's
- Performance analysis of a main memory multi-directory hashing technique
- Phorma: perfectly hashable order restricted multidimensional arrays
- Optimal hashing
- Hash function design for cloud storage data auditing
This page was built for publication: Collections of Functions for Perfect Hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3719841)