Links

    AM 221. Advanced Optimization

    This is a graduate-level course on optimization. The course covers mathematical programming and combinatorial optimization from the perspective of convex optimization, which is a central tool for solving large-scale problems. In recent years convex optimization has had a profound impact on...

    Read more about AM 221. Advanced Optimization

    CS 225. Pseudorandomness.

    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,...

    Read more about CS 225. Pseudorandomness.

    CS 127. Cryptography

    Cryptography is as old as human communication itself, but has undergone a revolution in the last few decades. It is now about much more than “secret writing” and includes seemingly paradoxical notions such as communicating securely without a shared secret, and computing on encrypted data. In this... Read more about CS 127. Cryptography

Pages