BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Bloom Filters\, Related Data Structures\, and their Applications -
  Michael Mitzenmacher (Harvard)
DTSTART:20090223T170000Z
DTEND:20090223T180000Z
UID:TALK15641@talks.cam.ac.uk
CONTACT:Neil Walton
DESCRIPTION:Many network monitoring and measuring tasks are now making use
  of hash-based data structures\, including Bloom filters and their many va
 riations. In this talk\, we review the basics and history of these data st
 ructures\, explaining why they have become a key building block in a varie
 ty of networking algorithms. We cover both the mathematics underlying thei
 r performance\, and some recent real-world applications. No previous backg
 round is required.
LOCATION:Wolfson Room (MR 2) Centre for Mathematical Sciences\, Wilberforc
 e Road\, Cambridge.
END:VEVENT
END:VCALENDAR