hi all , I have a small question concerning universal hashing , I understand that it involves picking a random hashing function to reduce the risk of someone abusing a particular hash slot , my question is how could you map a key back to its slot if you don't know the random value originally used to hash it.
Regards --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
