Hashing and Membership Filter Algorithms

Algorithms that find or test items by hashing them, such as the Bloom filter, cuckoo hashing, rendezvous hashing, the quotient filter and SimHash. An entry belongs here when its cited article describes a hash scheme or a probabilistic test of set membership. It excludes ordered search trees, which sit in their own group. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.