I am writing a Seminar about dynamic perfect hashing and its lower bound by the FKS schema using the the adversary method mentioned here by using a Tree data structure. But somehow i don t get how the tree is build by the algorithm. What i mean exactly that he algorithm only generates 2 perfect hash functions but according the adversary strategy generates like many perfect hash functions at each node and leaves are the items inserted by the hash function.

Can someone please help understand how the data structure is build while running the algo. thnx

  • $\begingroup$ i understand the adversary idea but i want to understand the used one with the hashing algorithm given by the paper and wiki in the link $\endgroup$ – Mohbenay Jan 1 at 1:11

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.