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

• Course website
• Syllabus
• Guidelines for Reading, Commenting, and Class Participation
• Course schedule
• Textbook: Pseudorandomness (draft monograph based on lecture notes from previous years).
• More information about the content and prerequisites can be found in the Spring 2009 Syllabus below, but the format of the course may change signficantly (with the lectures replaced by much more participatory discussion).

Past Offerings

Spring 2009

• Syllabus
• Lecture Notes
• Problem Sets

Spring 2007

• Syllabus
• Lecture Notes
• Problem Sets

Spring 2004

• Syllabus

Spring 2002

• Syllabus