University of Cambridge > Talks.cam > Kuwait Foundation Lectures > Bloom Filters, Related Data Structures, and their Applications

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

Bloom Filters, Related Data Structures, and their Applications

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

If you have a question about this talk, please contact Helen Innes.

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 Kuwait Foundation Lectures series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

SBR Graduate Talks European Research Group FERSA Lunchtime Sessions

Other talks

BP KEYNOTE LECTURE: Importance of C-O Bond Activation for CO2/COUtilization - An Approach to Energy Conversion and Storage Scaling of tissue proportions to body size during vertebrate development MEASUREMENT SYSTEMS AND INSTRUMENTATION IN THE OIL AND GAS INDUSTRY Double talk on Autism genetics Bioinformatics The Ethical and Legal Elements of Capacity and Consent Cambridge Rare Disease Summit 2017 Atiyah Floer conjecture An approach to the four colour theorem via Donaldson- Floer theory Molecular mechanisms of cardiomyopathies in patients with severe non-ischemic heart failure An SU(3) variant of instanton homology for webs
 

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