University of Cambridge > Talks.cam > Optimization and Incentives Seminar > Bloom Filters, Related Data Structures, and their Applications

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Bloom Filters, Related Data Structures, and their Applications

Download to your calendar using vCal

If you have a question about this talk, please contact Neil Walton .

Kuwait Foundation Lecture

Many network monitoring and measuring tasks are now making use of hash-based data structures, including Bloom filters and their many variations. In this talk, we review the basics and history of these data structures, explaining why they have become a key building block in a variety of networking algorithms. We cover both the mathematics underlying their performance, and some recent real-world applications. No previous background is required.

This talk is part of the Optimization and Incentives Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge Antiquarian Society ASNC Research Seminar Goldsmiths 1, Lecture Theatre, Department of Materials Science & Metallurgy

Other talks

Reversals of the Geodynamo Title TBC Title to be confirmed Title to be confirmed Title to be confirmed RNA-Mediated Regulation of Germinal Centre B-Cell Fitness: a tale of two DEAD-box RNA helicases
 

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