Fast Approximate Reconciliation of Set Differences
作者： Michael Mitzenmacher , John Byers , Jeffrey Considine
DOI:
关键词:
摘要: National Science Foundation (ANI-0093296, ANI-9986397, CCR-0118701, CCR-0121154); Alfred P. Sloan Research Fellowship
参考文章(7)
John Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost, Informed content delivery across adaptive overlay networks Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '02. ,vol. 32, pp. 47- 60 ,(2002) , 10.1145/633025.633031
Burton H. Bloom, Space/time trade-offs in hash coding with allowable errors Communications of the ACM. ,vol. 13, pp. 422- 426 ,(1970) , 10.1145/362686.362692
Y. Minsky, A. Trachtenberg, R. Zippel, Set reconciliation with nearly optimal communication complexity international symposium on information theory. ,vol. 49, pp. 2213- 2218 ,(2001) , 10.1109/TIT.2003.815784
M. V. Wilkes, The Art of Computer Programming, Volume 3, Sorting and Searching The Computer Journal. ,vol. 17, pp. 324- 324 ,(1974) , 10.1093/COMJNL/17.4.324
Thomas T. Cormen, Ronald L. Rivest, Charles E. Leiserson, Introduction to Algorithms ,(1990)
Wojciech Szpankowski, Charles Knessl, Limit Laws for Heights in Generalized Tries and PATRICIA Tries ,(1999)
Ralph C. Merkle, Protocols for Public Key Cryptosystems ieee symposium on security and privacy. pp. 122- 122 ,(1980) , 10.1109/SP.1980.10006