Verified hash-based AMQ structures in Coq

Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html

A fast bloom filter implemented by Rust for Python! 10x faster than pybloom!

implementations of a counting bloom, a timing bloom and a scaling timing bloom... made for working with streams!

Compact cache-friendly filter, for small number of elements.

In this project, I have implemented the Bloom filter, Counting Bloom filter, and Coded bloom filter.

Counting Bloom Filter Algorithm to count kmers

Bloom filter for D language

A counting bloom filter with probabilistic deletion capabilities also allowing a risky deletion which may lead to false negatives if not carefully used.

various probabilistic data structures implemented in C

Probability Methods for Informatics Engineering | UA 2018/2019