CS168: The Modern Algorithmic Toolbox Lecture #2: Approximate Heavy Hitters and the Count-Min Sketch
Space/time trade-offs in hash coding with allowable errors