An ordered minimal perfect hashing scheme based upon Euler's theorem
From MaRDI portal
Recommendations
- A scheme for constructing ordered minimal perfect hashing functions
- Experimental and Efficient Algorithms
- Minimal perfect hashing in polynomial time
- Theory and practice of monotone minimal perfect hashing
- Theory and practice of monotone minimal perfect hashing
- An optimal algorithm for generating minimal perfect hash functions
- scientific article; zbMATH DE number 1688373
- scientific article; zbMATH DE number 88958
- scientific article; zbMATH DE number 2065606
Cites work
- scientific article; zbMATH DE number 3646329 (Why is no real title available?)
- scientific article; zbMATH DE number 3466515 (Why is no real title available?)
- scientific article; zbMATH DE number 3471582 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- Addressing for Random-Access Storage with Multiple Bucket Capacities
- An indirect chaining method for addressing on secondary keys
- Analysis of a file addressing method
- Perfect hashing functions
- Reciprocal hashing
- The Study of a New Perfect Hash Scheme
Cited in
(4)
This page was built for publication: An ordered minimal perfect hashing scheme based upon Euler's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060014)