CS 225: Pseudorandomness
Prof. Salil Vadhan
Efficiently generating objects that "look random"
despite being constructed using little or no randomness. Connections and
applications to computational complexity, cryptography, and combinatorics.
Pseudorandom generators, randomness extractors, expander graphs,
error-correcting codes, hash functions.