Fingerprinting Sets
Report ID: TR-212-89Author: Lipton, Richard J.
Date: 1989-03-00
Pages: 6
Download Formats: |PDF|
Abstract:
We show how to efficiently compute hash functions that are invariant under permutations. These hash functions have a variety of applications to distributed computing problems.