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. 

Course Webpage (Spring 2009)

Past Offerings

Syllabus (Spring 2007)

Lecture Notes (Spring 2007)

Problem Sets (Spring 2007)

Syllabus (Spring 2004)

Syllabus (Spring 2002)