University of Cambridge > Talks.cam > Churchill CompSci Talks > Bloom filters

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Bloom filters

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Mott Seminar Room (Mott Building Room 531), Cavendish Laboratory Average on weekdays: 8909.7964876 kWh SciBar

Other talks

Understanding the Interplay between LLMs' Utilisation of Parametric and Contextual Knowledge Title TBC Title to be confirmed Grand Rounds - Equine TBC TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity