Cart (Loading....) | Create Account
Close category search window
 

A class of randomized strategies for low-cost comparison of file copies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Barbara, D. ; Dept. of Comput. Sci., Princeton Univ., NJ, USA ; Lipton, R.J.

A class of algorithms that use randomized signatures to compare remotely located file copies is presented. A simple technique that sends on the order of 4flog(n) bits, where f is the number of differing pages that are to be diagnosed and n is the number of pages 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 of algorithms in which the number of signatures grows with f as frf, where r can be made to approach 1, are also presented. A comparison of these techniques is discussed

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:2 ,  Issue: 2 )

Date of Publication:

Apr 1991

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.