Vikas Chauhan, Ari Trachtenberg fchauhan, Boston University...  Home/Search
Context
Related
| bu.edu/documents/recon_web.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: bu.edu/trachten/main (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of exchanging two similar strings held by different hosts with a minimum amount of communication. (Update)
Similar documents based on text: More All
0.2: Data Verification and Reconciliation With.. - Karpovsky, Levitin, .. (2001) (Correct)
0.1: Computational Methods in Coding Theory - Trachtenberg (1996) (Correct)
0.1: PRIDE: Photonics Research in Interdisciplinary Education - Unlu, Ruane, Goldberg.. (Correct)
BibTeX entry: (Update)
@misc{ ari-reconciliation,
author = "Vikas Chauhan Ari",
title = "Reconciliation Puzzles",
url = "citeseer.ist.psu.edu/704327.html" }
Citations (may not include all citations):166 Some complexity questions related to distributive computing (context) - Yao - 1979
33 Communication complexity of document exchange - Cormode, Paterson et al. - 2000
33 Set reconciliation with nearly optimal communication complex.. - Minsky, Trachtenberg et al. - 2001
26 Interactive communication: Balanced distributions - Orlitsky - 1991
21 Reconstructing strings from substrings - Skiena, Sundaram - 1995
5 the scalability of data synchronization protocols for PDAs a.. - Agarwal, Starobinski et al. - 2002
2 A probabilistic algorithm for updating files over a communic.. (context) - Evfimievski - 1998
2 All-trails algorithm (context) - Fleischner - 1991
2 All-trails algorithm (context) - Fleischner - 1991
1 Practical protocols for interactive communication (context) - Orlitsky, Viswanathan - 2001
1 Compositional representation of protein sequences and the nu.. (context) - Hao, Xie et al. - 2001
Documents on the same site (http://people.bu.edu/trachten/main.html): More
Efficient Reconciliation of Unordered Databases - Trachtenberg, Minsky (Correct)
Lexicographic Codes: Constructions Bounds, and Trellis.. - Trachtenberg, Vardy (Correct)
Set Reconciliation with Nearly Optimal Communication.. - Minsky, Trachtenberg.. (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC