@inproceedings{1e28b83d9a114c1eb6412c5dd4aca684,
title = "Weighted random assignments with application to hashing",
abstract = "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).",
author = "Yao, \{Andrew Chi Chih\}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 2nd Annual International Symposium on Algorithms, ISA 1991 ; Conference date: 16-12-1991 Through 18-12-1991",
year = "1991",
doi = "10.1007/3-540-54945-5\_47",
language = "英语",
isbn = "9783540549451",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
editor = "R.C.T. Lee and Wen-Lian Hsu",
booktitle = "ISA 1991 Algorithms - 2nd International Symposium on Algorithms, Proceedings",
}