D. Barbara, and R. J. Lipton. A class of Randomized Strategies for LowCost Comparison of File Copies. IEEE Trans. Parallel and Distributed Systems 2(2):160-170, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms for Delta Compression and Remote File Synchronization - Suel, Memon (2002) (Correct)
....presented earlier, or by transmitting the entire item in the case of small database records. In the following, we discuss the problems arising in this scenario, with emphasis on a recent approach described in [26, 33, 46] Some earlier work on reconciliation of record based data appeared in [7, 1, 31, 32]. Consider the case, assumed in [46] of a handheld device using the Palm Hotsync program to synchronize its database of addresses or appointments with a desktop device. If the handheld was last synchronized with the same desktop, then the Palm Hotsync software can use auxiliary logging ....
D. Barbara and R. Lipton. A class of randomized strategies for low-cost comparison of file copies. IEEE Transactions on Parallel and Distributed Systems, 2(2):160--170, April 1991.
Spreading Rumors Cheaply, Quickly, And Reliably - Minsky (2002) (Correct)
....or deletions into a string, along with in place replacements. Through the encoding described above, spurious error correction algorithms can be used as the basis for set reconciliation algorithms. Many methods have been proposed in the literature for spurious error correction and related problems [9, 40, 52, 1, 16]. Recently, Cormode, Paterson, ahinhalp, and Vishkin provided two round a probabilistic algorithm that requires O(d(x, y) log x ) communication bits for a reconciling two documents x and y that whose Levenshtein distance is d(x, y) 16] The problem of spurious error correction appears to ....
D. Barbara and R.J. Lipton. A class of randomized strategies for low-cost comparison of file copies. IEEE Transactions on Parallel Distributed Systems, pages 160--170, April 1991.
Communication Complexity of Document Exchange - Cormode, Paterson, Sahinalp.. (2000) (31 citations) (Correct)
....the transmission of Omega Gamma f log n) bits for the Hamming distance. If d(x; y) f , then the protocols result in an error; if d(x; y) o(f) then we show in this paper that too many bits are transmitted. Metzner [Met83, Met91] Abdel Ghaffar and El Abbadi [AGE94] and Barbar a and Lipton [BL91] consider the concrete problem of identifying different pages between two copies of an updated file. It is assumed that the differences between pages are aligned with the page boundaries, effectively resulting in Hamming differences. They also assume a known upper bound f on the number of pages ....
Daniel Barbara and Richard J. Lipton. A class of randomized strategies for low-cost comparison of file copies. IEEE Transactions on Parallel and Distributed Systems, 2(2):160-- 170, April 1991.
Algebraic Signatures for Scalable - Distributed Data Structures (Correct)
No context found.
D. Barbara, and R. J. Lipton. A class of Randomized Strategies for LowCost Comparison of File Copies. IEEE Trans. Parallel and Distributed Systems 2(2):160-170, 1991.
Set Reconciliation with Nearly Optimal Communication.. - Minsky, Trachtenberg.. (2004) (14 citations) (Correct)
No context found.
D. Barbara and R.J. Lipton, "A class of randomized strategies for low-cost comparison of file copies," IEEE Transactions on Parallel Distributed Systems, pp. 160--170, April 1991.
Improved File Synchronization Techniques for Maintaining - Large Replicated Collections (Correct)
No context found.
D. Barbara and R. Lipton. A class of randomized strategies for low-cost comparison of file copies. IEEE Transactions on Parallel and Distributed Systems, 2(2):160--170, Apr. 1991.
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