Minimal perfect hashing in polynomial time
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3116692 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3305564 (Why is no real title available?)
- Fast modular transforms
- Perfect hashing functions
- Reciprocal hashing
- Storing a Sparse Table with 0 (1) Worst Case Access Time
Cited in
(17)- A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
- Graphs, hypergraphs and hashing
- On the Circuit Complexity of Perfect Hashing
- scientific article; zbMATH DE number 7051248 (Why is no real title available?)
- Quasi-perfect Hashing
- Experimental and Efficient Algorithms
- A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
- Polynomial hash functions are reliable (extended abstract)
- An optimal algorithm for generating minimal perfect hash functions
- An algebraic approach to Cichelli's perfect hashing
- scientific article; zbMATH DE number 370478 (Why is no real title available?)
- Secure two-party input-size reduction: challenges, solutions and applications
- Construct a perfect word hash function in time independent of the size of integers
- An ordered minimal perfect hashing scheme based upon Euler's theorem
- A compact hash function for paths in PERT networks
- Perfect hashing
- A scheme for constructing ordered minimal perfect hashing functions
This page was built for publication: Minimal perfect hashing in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911304)
