University of Cambridge > > Churchill CompSci Talks > Bloom filters

Bloom filters

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact John Wickerson.

Bloom filters are probabilistic data structures used to test whether an element is a member of a set. They are very space-efficient, but may return false-positive results.

This talk is part of the Churchill CompSci Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity