Name
Abstract | ||
|---|---|---|
A class of algorithms that use randomized signatures to compare remotely located filecopies is presented. A simple technique that sends on the order of 4/sup f/log(n) bits,where f is the number of differing pages that are to be diagnosed and n is the number ofpages in the file, is described. A method to improve the bound in the number of bits sent,making them grow with f as flog(f) and with n as log(n)log(log(n)), and a class ofalgorithms in which the number of signatures grows with f as fr/sup f/, where r can bemade to approach 1, are also presented. A comparison of these techniques is discussed. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1109/71.89062 | Parallel and Distributed Systems, IEEE Transactions |
Keywords | Field | DocType |
algorithm theory,file organisation,security of data,differing pages,file copies,randomized signatures,randomized strategies,remotely located file copies | Computer science,Device file,Class implementation file,Torrent file,Algorithm theory,Fork (file system),Versioning file system,Indexed file,Distributed computing,Computer file | Journal |
Volume | Issue | ISSN |
2 | 2 | 1045-9219 |
Citations | PageRank | References |
16 | 8.02 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Barbará | 1 | 2872 | 1148.49 |
| Richard J. Lipton | 2 | 6412 | 1796.57 |