Collections of Functions for Perfect Hashing
From MaRDI portal
Recommendations
Cited in
(25)- A backtracking method for constructing perfect hash functions from a set of mapping functions
- Two results on tables
- A practical method for implementing string pattern matching machines
- The effect of table expansion on the program complexity of perfect hash functions
- Performance analysis of a main memory multi-directory hashing technique
- A note on hashing functions and tabu search algorithms
- A refinement of a compression-oriented addressing scheme
- Perfect hashing
- Phorma: perfectly hashable order restricted multidimensional arrays
- Hash function design for cloud storage data auditing
- Parameterized hash functions
- A new practical algorithm for the construction of a perfect hash function
- Hash table reorganization
- Optimal hashing
- Computing the probability of hash table/urn overflow
- Key-To-Address Transformation Techniques
- scientific article; zbMATH DE number 1070502 (Why is no real title available?)
- Dimensioning a multiple hashing scheme
- scientific article; zbMATH DE number 2065606 (Why is no real title available?)
- scientific article; zbMATH DE number 2112400 (Why is no real title available?)
- An algorithm for dynamic processing of dawg's
- Polynomial hash functions are reliable (extended abstract)
- Perfect hashing schemes for mining traversal patterns
- Space/time trade-offs in hash coding with allowable errors
- Engineering minimal \(k\)-perfect hash functions
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)