Tim Roughgarden Lectures
Publishes 4 feeds
A Second Course in Algorithms (Stanford CS261, Winter 2016)
15 posts · theirs
Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)
15 posts · theirs
Algorithmic Game Theory (Stanford CS364A, Fall 2013)
15 posts · theirs
Advanced Mechanism Design (Stanford CS364B, Winter 2014)
15 posts · theirs
Lately
A Second Course in Algorithms (Lecture 15: Introduction to Approximation Algorithms)
A Second Course in Algorithms (Stanford CS261, Winter 2016) ·
A Second Course in Algorithms (Lecture 14: Online Bipartite Matching)
A Second Course in Algorithms (Stanford CS261, Winter 2016) ·
A Second Course in Algorithms (Lecture 13: Online Scheduling and Online Steiner Tree)
A Second Course in Algorithms (Stanford CS261, Winter 2016) ·
A Second Course in Algorithms (Lecture 12: Applications of Multiplicative Weights to Games and LPs)
A Second Course in Algorithms (Stanford CS261, Winter 2016) ·
A Second Course in Algorithms (Lecture 11: Online Learning and the Multiplicative Weights Algorithm)
A Second Course in Algorithms (Stanford CS261, Winter 2016) ·
A Second Course in Algorithms (Lecture 10: The Minimax Theorem & Algorithms for Linear Programming)
A Second Course in Algorithms (Stanford CS261, Winter 2016) ·
A Second Course in Algorithms (Lecture 9: Linear Programming Duality --- Part 2)
A Second Course in Algorithms (Stanford CS261, Winter 2016) ·
A Second Course in Algorirthms (Lecture 8: Linear Programming Duality --- Part 1)
A Second Course in Algorithms (Stanford CS261, Winter 2016) ·
A Second Course in Algorithms (Lecture 7: Linear Programming: Introduction and Applications)
A Second Course in Algorithms (Stanford CS261, Winter 2016) ·
A Second Course in Algorithms (Lecture 6: Generalizations of Maximum Flow and Bipartite Matching)
A Second Course in Algorithms (Stanford CS261, Winter 2016) ·
A Second Course in Algorithms (Lecture 5: Minimum-Cost Bipartite Matching)
A Second Course in Algorithms (Stanford CS261, Winter 2016) ·
A Second Course in Algorithms (Lecture 4: Applications of Maximum Flows and Minimum Cuts)
A Second Course in Algorithms (Stanford CS261, Winter 2016) ·
Everything on this page was read from markup Tim Roughgarden Lectures published — a rel="me" link, an h-card, or the feed’s own author element. Nothing was inferred from anywhere else. To correct or remove it, get in touch. Machine-readable: JSON
