[1] J. Byers, J. Considine,M. Mitzenmacher, “Fast Approximate Reconciliation of Set Differences,” BU Computer Science TR, Boston University, 2002 [2] D. Starobinski, A. Trachtenberg,S. Agarwal, “Efficient PDA Synchronization,” IEEE Transactions on Mobile Computing, Vol. 2, No.1, pp. 40-51, 2003 [3] B. Zhu, K. Li,H. Patterson, “Avoiding the Disk Bottleneck in the Data Domain Deduplication File System,” inProceedings of the 6th USENIX Conference on File and Storage Technologies, pp. 1-14, San Jose, California, USA, February 2008 [4] P. Kulkarni, F. Douglis, J. Lavoie,J. M. Tracey, “Redundancy Elimination Within Large Collections of Files,” inProceedings of the 2004 USENIX Annual Technical Conference, pp. 1-14, Boston, MA, USA, June 2004 [5] D. Eppstein, M. T. Goodrich, F. Uyeda,G. Varghese, “What's the Difference? Efficient Set Reconciliation Without Prior Context,” inProceedings of the ACM SIGCOMM 2011, pp. 218-229, Toronto, Ontario, Canada, August 2011 [6] M. Skjegstad and T. Maseng, “Low Complexity Set Reconciliation using Bloom Filters,” inProceedings of the 7th ACM SIGACT/ SIGMOBILE International Workshop on Foundations of Mobile Computing, pp. 33-41, San Jose, California, USA, June 2011 [7] Y. Minsky, A. Trachtenberg,R. Zippel, “Set Reconciliation with Nearly Optimal Communication Complexity,” IEEE Transactions on Information Theory, Vol. 49, No. 9, pp. 2213-2218, 2003 [8] A. Trachtenberg, D. Starobinski,S. Agarwal, “Fast PDA Synchronization using Characteristic Polynomial Interpolation,” inProceedings of IEEE INFOCOM 2002, pp.1510-1519, New York, NY, USA, 2002 [9] Y. Minsky and A. Trachtenberg, “Practical Set Reconciliation,” BU Computer Science TR, Boston University, 2002 [10] J. W. Byers, J. Considine, M. Mitzenmacher,S. Rost, “Informed Content Delivery across Adaptive Overlay Networks,” ACM SIGCOMM Computer Communication Review, Vol. 32, No. 4, pp. 47-60, 2002 [11] Z. Y. Hu, X. Q. Teng, D. Guo, B. B. Ren, P. Lv,Z. Liu, “Comparing Set Reconciliation Methods based on Bloom Filters and Their Variants,” Tsinghua Science and Technology, Vol. 21, No. 2, pp. 157-167, 2016 [12] D. Guo and M. Li, “Set Reconciliation via Counting Bloom Filters,” IEEE Transactions on Knowledge and Data Engineering, Vol. 25, No. 10, pp. 2367-2380, 2013 [13] R. Gabrys and A. Coker, “Set Reconciliation in Two Rounds of Communication,” inProceedings of International Command and Control Research and Technology Symposium (ICCRTS), pp. 1-7, Annapolis, Maryland, USA, June 2015 [14] B. H. Bloom, “Space / Time Trade-offs in Hash Coding with Allowable Errors,” Communications of the ACM, Vol. 13, No. 7, pp. 422-426, 1970 [15] L. Fan, P. Cao, J. Almeida,A. Z. Broder, “Summary Cache: a Scalable Wide-area Web Cache Sharing Protocol,” IEEE/ACM Transactions on Networking (TON), Vol. 8, No. 3, pp. 281-293, 2000 [16] D. Guo, Y. H. Liu, X. Y. Li,P. L. Yang, “False Negative Problem of Counting Bloom Filter,” IEEE Transactions on Knowledge & Data Engineering, Vol. 22, No. 5, pp. 651-664, 2010 |