Hash functions

type of function that maps data of arbitrary size to data of fixed size

hash function where the input is hashed in a window that moves through the input

thumb|right|An arbitrary Identicon An Identicon is a visual representation of a hash value, usually of an IP address, that serves to identify a user of a computer system as an effectively random form of avatar while protecting the user's privacy. The original Identicon was a 9-block graphic, and the representation has been extended to other graphic forms by third parties.

set of hash functions generate no collisions

In computer science and data mining, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are. The scheme was published by Andrei Broder in a 1997 conference, and initially used in the AltaVista search engine to detect duplicate web pages and eliminate them from search results. It has also been applied in large-scale clustering problems, such as clustering documents by the similarity of their sets of words.

hash function construction used in computer programs that play abstract board games