Reconciliation puzzles

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 2, Issue , 2004, Pages 600-604

  Chauhan, Vikas ^a   Trachtenberg, Ari ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERISTIC POLYNOMIAL INTERPOLATION SYNCHRONIZATION PROTOCOL; COMMUNICATIONAL COMPLEXITY; DATA DISTRIBUTION SYSTEMS; STRING RECONCILIATION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

TELECOMMUNICATION SYSTEMS;

EID: 18144430181     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Sachin Agarwal, David Starobinski, and Ari Trachtenberg. On the scalability of data synchronization protocols for PDAs and mobile devices. IEEE Network, 16(4):22-28, July/August 2002.
2. A. D. Birrell, A. Hisgen, C. Jerian, T. Mann, and G. Swart. The Echo distributed file system. Technical Report 111, Palo Alto, CA, USA, 10 1993.
3. Graham Cormode, Mike Paterson, Suleyman Cenk Sahinalp, and Uzi Vishkin. Communication complexity of document exchange. In Symposium on Discrete Algorithms, pages 197-206, 2000.
4. Alexandre V. Evfimievski. A probabilistic algorithm for updating files over a communication link. In Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 300-305, 1998.
5. Richard G. Guy, John S. Heidemann, Wai Mak, Thomas W. Page, Jr., Gerald J. Popek, and Dieter Rothmeir. Implementation of the Ficus Replicated File System, pages 63-72, Summer 1990.
6. Bailin Hao, Huilin Xie, and Shuyu Zhang. Compositional representation of protein sequences and the number of Eulerian loops. arXiv:physics/0103028 vl, 1, 2001.
7. Y. Minsky, A. Trachtenberg, and R. Zippel. Set reconciliation with nearly optimal communication complexity. In International Symposium on Information Theory, page 232, 2001.
8. Y. Minsky, A. Trachtenberg, and R. Zippel. Set reconciliation with nearly optimal communication complexity. IEEE Transactions on Information Theory, 49(9):2213-2218, 2003.
9. Albert Nijenhuis and Herbert S. Wilf. Combinatorial Algorithms. Academic Press, 1975.
10. Alon Orlitsky. Interactive communication: Balanced distributions, correlated files, and average-case complexity. In IEEE Symposium on Foundations of Computer Science, pages 228-238, 1991.
11. Alon Orlitsky and Krishnamurthy Viswanathan. Practical protocols for interactive communication. In IEEE International Symposium on Information Theory, page 115, 2001.
12. M. Satyanarayanan, James J. Kistler, Puneet Kumar, Maria E. Okasaki, Ellen H. Siegel, and David C. Steere. Coda: A highly available file system for a distributed workstation environment. IEEE Transactions on Computers, 39(4):447-459, 1990.
13. S. S. Skiena and G. Sundaram. Reconstructing strings from substrings. Journal Of Computational Biology, 2:333-353, 1995.
14. D. Starobinski, A. Trachtenberg, and S. Agarwal. Efficient PDA synchronization. IEEE Transactions on Mobile Computing, 2(1):40-51, Jan/March 2003.
15. A. C. Yao. Some complexity questions related to distributive computing. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing, pages 209-213, 1979.