Is there a Cormen-like reference on Hashes and Hashing? This particular structure has seen little attention in my CS education for some reason but I'd like to learn more as they seem to be everywhere. I know Cormen covers it but I'm looking for something more specialized and in-depth.
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
I really enjoyed the book File Organization and Processing. Despite it's name, it's just a book of data structures. The first half is about hashing and various collision resolution methods, and later on there is coverage of some dynamic hashing algorithms.
It's a little old but it's still useful. There are step-by-step examples for each algorithm and answers to the exercises.
Disclaimer: I'm biased because the author was one of my CS professors.
p.s. One might argue that new bibles aren't being created anymore these days. There are just very good pages on Wikipedia and Stack Overflow. :)
My guess learning about hashes is not the same of learning about random number generators (rng) but its very similar field in a way of knowing what differ a real random number from a pseudo-random and the quality about randomness. You probably know about xor-ing an image to hide any kind of data that you could extract from it, so, thats my guess. You need some good seeds for a good hash and knowing about randomness could help.
protected by gnat Dec 6 '14 at 6:45
Thank you for your interest in this question.
Because it has attracted low-quality or spam answers that had to be removed, posting an answer now requires 10 reputation on this site (the association bonus does not count).
Would you like to answer one of these unanswered questions instead?