Weighted random assignments with application to hashing

  • Andrew Chi-Chih Yao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 557)


In this talk we will study the optimal solution to a class of random assignment problems with dependent weights. The result is then used to show that, in double hashing, the expected retrieval cost with respect to an optimal static hash table is O(1) even if the table is full. This confirms a conjecture of Gonnet and Munro (SIAM J. on Computing 8 (1979), 463–478).

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Andrew Chi-Chih Yao
    • 1
  1. 1.Department of Computer SciencePrinceton UniversityPrincetonUSA

Personalised recommendations