Bloom filters

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

• Oliver Stannard
• Tuesday 21 February 2012, 18:30-19:30
• Club Room, Churchill College.

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.

This talk is included in these lists:

• Churchill CompSci Talks
• Club Room, Churchill College
• computer science
• se393's list

Note that ex-directory lists are not shown.