I wasn't there. Not a good 2 weeks for me. Blame McHacks.
An analysis of quicksort. Somehow different from the one on March 13?
Hash tables and bucket size. Max bucket size is apparently $\leq 2\log(n) + 1$. Proof: uses Boole's inequality (union bound) and a whole lot of other shit