universal-hashing
Here are 12 public repositories matching this topic...
simple hash functions in go: a simple hash function implementing Horner's rule and a universal hash function implementing the Carter-Wegman method.
-
Updated
Mar 22, 2017 - Go
Hazz, a pseudo-random-data-filled-table, to generate k indipendent and uniform, very fast hash functions.
-
Updated
Feb 17, 2018 - JavaScript
Implementation of a perfect hashing data structure. We say a hash function is perfect for S if all lookups involve O(1) work.
-
Updated
May 28, 2023 - Java
Asino a stubborn, simple and fast Bloom filter for the rest of us.
-
Updated
Jan 9, 2018 - JavaScript
Merge Sort-Insertion Sort-Heap Sort- Hash Table algorithms are included in these projects.
-
Updated
May 4, 2019 - C++
Hash functions and tables in Java
-
Updated
Jan 22, 2019 - Java
Implementation of a perfect hashing data structure using different space complexity solutions.
-
Updated
Apr 24, 2024 - Java
PolymurHash port in Zig.
-
Updated
Nov 24, 2023 - Zig
-
Updated
Feb 10, 2021 - C++
Different algorithms and data structures implementations.
-
Updated
Jun 19, 2017 - C++
Impelementation for some Perfect hashing algorithms
-
Updated
May 21, 2017
Improve this page
Add a description, image, and links to the universal-hashing topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the universal-hashing topic, visit your repo's landing page and select "manage topics."