Verified hash-based AMQ structures in Coq
-
Updated
Apr 13, 2020 - Coq
Verified hash-based AMQ structures in Coq
Probabilistic data structures in python https://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.
Probability Methods for Informatics Engineering | UA 2018/2019
Add a description, image, and links to the counting-bloom-filter topic page so that developers can more easily learn about it.
To associate your repository with the counting-bloom-filter topic, visit your repo's landing page and select "manage topics."