There are 1 repository under universal-hashing topic.
simple hash functions in go: a simple hash function implementing Horner's rule and a universal hash function implementing the Carter-Wegman method.
Implementation of a perfect hashing data structure. We say a hash function is perfect for S if all lookups involve O(1) work.
Hazz, a pseudo-random-data-filled-table, to generate k indipendent and uniform, very fast hash functions.
Merge Sort-Insertion Sort-Heap Sort- Hash Table algorithms are included in these projects.
PolymurHash port in Zig.
Impelementation for some Perfect hashing algorithms
Implementation of a perfect hashing data structure using different space complexity solutions.
Different algorithms and data structures implementations.
Hash functions and tables in Java