A Java implementation of a dynamic perfect hash. This implementation is based upon the work done by Dietzfelbinger et. al in their paper Dyanamic Perfect Hashing: Upper and Lower Bounds and uses the standard doubling scheme for dynamically allocating the size of the table and bins.
-
Notifications
You must be signed in to change notification settings - Fork 1
mjn/dynperfhash-java
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published