LeMac - A fast AES-based universal hash function and MAC.

simple hash functions in go: a simple hash function implementing Horner's rule and a universal hash function implementing the Carter-Wegman method.

Hazz, a pseudo-random-data-filled-table, to generate k indipendent and uniform, very fast hash functions.

Implementation of a perfect hashing data structure. We say a hash function is perfect for S if all lookups involve O(1) work.

Multimixer-128: Universal Keyed Hashing Based on Integer Multiplication

Asino a stubborn, simple and fast Bloom filter for the rest of us.

Merge Sort-Insertion Sort-Heap Sort- Hash Table algorithms are included in these projects.

Hash functions and tables in Java

PolymurHash port in Zig.

Impelementation for some Perfect hashing algorithms

No description provided.

Different algorithms and data structures implementations.