The course "Design and Analysis of Algorithms (Part 2)" on Coursera has already started.

The starting point for the course "Design and Analysis of Algorithms (Part 2)"  on  Coursera  is  3  December 2012. In this course you will learn several fundamental principles of advanced algorithm design: greedy algorithms and applications; dynamic programming and applications; NP-completeness and what it means for the algorithm designer; the design and analysis of heuristics; and more.The Instructor:  Tim Roughgarden.

The starting point for the course "Design and Analysis of Algorithms (Part 2)"  on  Coursera  is  3  December 2012.  In this course you will learn several fundamental principles of advanced algorithm design: greedy algorithms and applications; dynamic programming and applications; NP-completeness and what it means for the algorithm designer; the design and analysis of heuristics; and more.

 The Instructor:  Tim Roughgarden

 Tim Roughgarden is an Associate Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University, where he holds the Chambers Faculty Scholar development chair. At Stanford, he has taught the Design and Analysis of Algorithms course for the past eight years. His research concerns the theory and applications of algorithms, especially for networks, auctions and other game-theoretic applications, and data privacy. For his research, he has been awarded the ACM Grace Murray Hopper Award, the EATCS-SIGACT Godel Prize, the Presidential Early Career Award for Scientists and Engineers (PECASE), and the Mathematical Programming Society's Tucker Prize.