J. Andrew Rogers personal blog
Fast Perfect Hashing
A perfect hash function is one that is collision-free. By implication, the hash must be at least as many bytes as the key and the function is theoretically reversible, though not always tractably so. In other words, perfect hashing is a special case of encryption. Because the hash is no smaller than the key, the…
- Points
- 138
- HN comments
- 41
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSoftware Engineering2019
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Feb 13, 2019 | Fast Perfect Hashing by dmit | 138 | 41 |
