Tim Roughgarden

Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University. He received a BS in Applied Mathematics from Stanford in 1997, and a PhD in Computer Science from Cornell in 2002. His research interests include the many connections between computer science and economics, as well as the design, analysis, applications, and limitations of algorithms. For his research, he has been awarded the ACM Grace Murray Hopper Award, the Presidential Early Career Award for Scientists and Engineers (PECASE), the Kalai Prize in Computer Science and Game Theory, the Shapley Lecturership of the Game Theory Society, the Social Choice and Welfare Prize, INFORM’s Optimization Prize for Young Researchers, the Mathematical Programming Society’s Tucker Prize, the EATCS-SIGACT Gödel Prize, and a Guggenheim Fellowship.

Filter Courses within "Tim Roughgarden" (Click to filter)
Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera) Coursera
Stanford University

Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera)

Dive into the core concepts of computer science with our specialized online course on Divide and Conquer, Sorting and Searching, and Randomized Algorithms. This course is designed for those who want to understand how to efficiently manage large datasets and solve complex computational problems using advanced techniques. Learn about asymptotic notation, sorting algorithms like Merge Sort and QuickSort, searching methods such as Binary Search, and the power of randomized approaches.

Jun 8th 2026
4 Weeks
Graph Search, Shortest Paths, and Data Structures (Coursera) Coursera
Stanford University

Graph Search, Shortest Paths, and Data Structures (Coursera)

Dive into the world of advanced data structures and graph algorithms with our Graph Search, Shortest Paths, and Data Structures course. This specialized program is designed for those looking to deepen their understanding of essential concepts like heaps, balanced search trees, hash tables, bloom filters, and more. Explore practical applications in connectivity and shortest path analysis, and discover how these principles can be applied to solve complex problems across various fields.

Jun 8th 2026
4 Weeks
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Coursera) Coursera
Stanford University

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Coursera)

Dive into the world of efficient problem-solving with our specialized online course on Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming. This course is designed for those who want to enhance their algorithmic skills and learn how to tackle intricate computational challenges effectively.

Jun 8th 2026
4 Weeks
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them (Coursera) Coursera
Stanford University

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them (Coursera)

Dive into advanced algorithmic concepts with 'Shortest Paths Revisited, NP-Complete Problems and What To Do About Them'. This course unravels the intricacies of shortest path algorithms, delves into the realm of NP-completeness, and equips you with strategies to tackle computationally hard problems effectively.

Jun 1st 2026
4 Weeks
Page 1