CS 225: Pseudorandomness

Prof. Salil Vadhan

Course Description

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. 

Spring 2011 offering

Past Offerings

Spring 2009

Spring 2007

Spring 2004

Spring 2002