Michael A. Bender
, Stony Brook University
Date: Monday, November 02, 2020
Time: 2:00 PM to 3:00 PM Note: all times are in the Eastern Time Zone
Location: https://mit.zoom.us/meeting/register/tJUrdOqopj8uHdO4gUyVMnfglOFEqIye_Je0 (Registration required, if you haven't registered for this series before)
Event Type: Seminar
Host: Julian Shun, MIT CSAIL
Contact: Julian Shun, email@example.com, firstname.lastname@example.org
Relevant URL: http://fast-code.csail.mit.edu/
Speaker URL: https://www3.cs.stonybrook.edu/~bender/
email@example.com, firstname.lastname@example.org, email@example.com, firstname.lastname@example.org, email@example.com, firstname.lastname@example.org, email@example.com
Abstract: A Bloom filter maintains a compact, probabilistic representation of a set S of keys from a universe U. The price of being small is that there is a (bounded) probability of false positives.
This talk reviews alternative filter designs, focusing on quotient and cuckoo filters. These newer filters are faster, more space efficient, and support a broader range of operations. We focus on both the theoretical and engineering issues that arise.
Bio: Michael A. Bender is the David R. Smith Leading Scholar of Computer Science at Stony Brook University. His research interests span the areas of data structures and algorithms, I/O-efficient computing, parallel computing, and scheduling. He has coauthored over 150 articles on these and other topics. He has won several awards, including an R&D 100 Award, a Test-of-Time award, two Best Paper Awards, and five awards for graduate and undergraduate teaching.
Bender was Founder and Chief Scientist at Tokutek, Inc, an enterprise database company, which was acquired by Percona in 2015. He has held Visiting Scientist positions at both MIT and King's College London.
Bender received his B.A. in Applied Mathematics from Harvard University in 1992 and obtained a D.E.A. in Computer Science from the Ecole Normale Superieure de Lyon, France in 1993. He completed a Ph.D. on Scheduling Algorithms from Harvard University in 1998.
IMPORTANT NOTE FOR ATTENDEES: If you have already registered for the Fast Code Seminars on Zoom since July 27, 2020, please use the Zoom link that you have received. This link will stay the same for subsequent Fast Code seminars this semester. Zoom does not recognize a second registration, and will not send out the link a second time. If you have any problems with registration, please contact firstname.lastname@example.org and email@example.com by 1:30pm on the day of the seminar, so that we can try to resolve it before the seminar begins.
Algorithms & Theory, Programming Languages & Software, Systems & Networking
Created by Julian J. Shun at Tuesday, October 27, 2020 at 3:26 PM.