Bloom Filters, Related Data Structures, and their Applications

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

• Michael Mitzenmacher (Harvard)
• Monday 23 February 2009, 17:00-18:00
• Wolfson Room (MR 2) Centre for Mathematical Sciences, Wilberforce Road, Cambridge..

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:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Economics and Computer Science Talks
• Hanchen DaDaDash
• Interested Talks
• Optimization and Incentives Seminar
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Trust & Technology Initiative - interesting events
• Wolfson Room (MR 2) Centre for Mathematical Sciences, Wilberforce Road, Cambridge.
• bld31

Note that ex-directory lists are not shown.