Timeline for Designing a Hash function that results in minimum size and no collisions
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 16, 2012 at 21:06 | comment | added | Gerhard Paseman | If you are unfortunate enough to be given 0 and the numbers from N+1 to 2N-1, it will take your scheme a while to find the desired modulus. We can extend this by using products like (N+i)(2N+i) for many i, and so on. You might find it useful to study examples like this in your research. Gerhard "Ask Me About System Design" Paseman, 2012.08.16 | |
| Aug 16, 2012 at 19:10 | vote | accept | Daniel | ||
| Aug 16, 2012 at 16:34 | answer | added | Suvrit | timeline score: 2 | |
| Aug 16, 2012 at 15:16 | history | asked | Daniel | CC BY-SA 3.0 |