BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computer Engineering & Systems Group - Texas A&M University - ECPv5.2.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computer Engineering & Systems Group - Texas A&M University
X-ORIGINAL-URL:https://cesg.tamu.edu
X-WR-CALDESC:Events for Computer Engineering & Systems Group - Texas A&M University
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20120311T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20121104T070000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20121017T150000
DTEND;TZID=America/Chicago:20121017T170000
DTSTAMP:20210926T015952
CREATED:20121010T130333Z
LAST-MODIFIED:20121010T130333Z
UID:1584-1350486000-1350493200@cesg.tamu.edu
SUMMARY:Fishbowl teleseminar: The Power of Choice : Simple Hash-Based Data Structures Everyone Should Know
DESCRIPTION:Prof. Michael Mitzenmacher\nProfessor of Computer Science\nHarvard University \n \nAbstract: \nMany computing tasks\, particularly in networking\, databases\, or other areas with large quantities of information\, now make use of hash-based data structures. Specific examples include Bloom filters\, multiple-choice hashing schemes\, and cuckoo hashing. We review the basics and history of these data structures\, explaining why they have become a key algorithmic building block. We examine both the mathematics underlying their performance and real-world applications. The talk is intended to be an introduction; no previous knowledge of hashing is required. \n \nBio: \nMichael Mitzenmacher is a Professor of Computer Science (and currently Area Dean for Computer Science) in the School of Engineering and Applied Sciences at Harvard University. Michael has authored or co-authored over 150 conference and journal publications on a variety of topics\, including algorithms for the Internet\, efficient hash-based data structures\, erasure and error-correcting codes\, power laws\, and compression. His work on low-density parity-check codes shared the 2002 IEEE Information Theory Society Best Paper Award and won the 2009 ACM SIGCOMM Test of Time\nAward. His textbook on randomized algorithms and probabilistic techniques in computer science was published in 2005 by Cambridge University Press. \nMichael Mitzenmacher graduated summa cum laude with a B.A. in mathematics and computer science from Harvard in 1991. After studying mathematics for a year in Cambridge\, England\, on the Churchill Scholarship\, he obtained his Ph. D. in computer science at U.C. Berkeley in 1996. He then worked at Digital Systems Research Center until joining the Harvard faculty in 1999.
URL:https://cesg.tamu.edu/seminar/fishbowl-teleseminar-the-power-of-choice-simple-hash-based-data-structures-everyone-should-know/
END:VEVENT
END:VCALENDAR