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.
- 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).
- Packet Level Algorithms [DIMACS 2007]
This (poorly named) talk was a DIMACS tutorial covering my work on hashing/Bloom filters in network architectures.
- 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.
- 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.
- 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.
- 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.
- New Results and Open Problem for Insertion/Deletion Channels
Update of a talk given at ANALCO (and elsewhere).
- New Directions for Power Law Research
Recently given at a Radcliffe workshop (and elsewhere).
pdf version
- Digital Fountains: Applications and Related Issues
Recently given at INFORMS (invited by Bruce Hajek); a previous version was given at ITW 2004.