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

Verified hash-based AMQ structures in Coq

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.

Counting Bloom Filter Algorithm to count kmers

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

Probabilistic data structures for .NET (Classic, Counting, and Scalable Bloom Filters). Bachelor thesis project.

various probabilistic data structures implemented in C

A Counting Bloom Filter Easy to Use.

Bloom filter for D language

Probability Methods for Informatics Engineering | UA 2018/2019

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