Michael Mitzenmacher : Talks

I don't usually put up talks, but sometimes people ask me to, so when they do, I'll put them here. They're in Powerpoint unless otherwise noted.

1. Some Results on Codes for Flash Memory [London 2009]
2. Network Coding Meets TCP [London 2009]
3. A History of and New Directions for Research for Power Laws [SUNY Buffalo 2008]
4. Toward Validation and Control of Network Models [IPAM 2008]
   Talk given at IPAM meeting, November 2008.
5. Designing Floating Codes for Expected Performance [Allerton 2008]
   A possible "new direction" for floating codes, with some theory and experiments.
6. Moves on Inserts and Deletes [Allerton 2008]
   Improving Multi-Level Hash Tables.
7. Cuckoo Hashing and CAMs [Cisco/Google 2008]
   How to use Content Addressable Memories to make cuckoo hashing even better.
8. Why Simple Hash Functions Work [Cisco 2008]
   Extended version of SODA paper talk below.
9. New Results and Open Problem for Channels with Synchronization [SWAT2008]
   Update on previous talks on deletion channels and related channels. Comes now with a tasty Survey Article!
10. Why Simple Hash Functions Work [SODA2008]
11. Cuckoo Hashing in Hardware [Allerton 2007]
    This talk covers how to use a CAM as a queue to effectively de-amortize cuckoo hashing for practical use in hardware (particularly routers).
12. Packet Level Algorithms [DIMACS 2007]
    This (poorly named) talk was a DIMACS tutorial covering my work on hashing/Bloom filters in network architectures.
13. Hashing and Packet Based Algorithms [Cisco 2007]
    This (still poorly named) talk was a somewhat modified version of the DIMACS tutorial I gave at Cisco covering my work on hashing/Bloom filters in network architectures.
14. Codes for Insertion/Deletion Channels with Segmented Errors
    We have high performance linear time encodable/decodable codes for binary channels with deletions (or insertions) as long as the errors are segmented -- say, at most one error per byte. Given at ISIT 2007.
15. Upper Bounding the Capacity of the Deletion Channel
    First non-trivial upper bound techniques (at least that I know of) for the binary iid deletion channel. Given at ISIT 2007.
16. Beyond Bloom Filters
    All about approximate concurrent state machines (ACSMs), and new constructions of Bloom filters/counting Bloom filters. Given at Stanford, UC Santa Cruz, Stochastic Networks workshop, etc.
17. New Results and Open Problem for Insertion/Deletion Channels
    Update of a talk given at ANALCO (and elsewhere).
18. New Directions for Power Law Research
    Recently given at a Radcliffe workshop (and elsewhere). pdf version
19. Digital Fountains: Applications and Related Issues
    Recently given at INFORMS (invited by Bruce Hajek); a previous version was given at ITW 2004.