Ranked #1
Lecture 10: Dynamic Programming: Advanced DP
Lecture 10: Dynamic Programming: Advanced DP
In this lecture, Professor Devadas introduces the concept of dynamic programming.
3 Jan 2017
•
1hr 20mins
Ranked #2
Recitation 10: Distributed Algorithms
Recitation 10: Distributed Algorithms
In this recitation, problems related to distributed algorithms are discussed.
3 Jan 2017
•
50mins
Similar Podcasts
Mathematics for Computer Science (2015)
Advanced Data Structures
Introduction to Algorithms (2011)
Introduction to Algorithms (2005)
Mathematics for Computer Science (2010)
Computer System Engineering
Probabilistic Systems Analysis and Applied Probability (2013)
Learn Differential Equations: Up Close with Gilbert Strang and Cleve Moler
Computer Systems Security
OCW Scholar: Introduction to Computer Science and Programming
Introduction to Computational Thinking and Data Science
Linear Algebra
Programming Paradigms
OCW Scholar: Introduction to Electrical Engineering and Computer Science I
Probabilistic Systems Analysis and Applied Probability
Ranked #3
Lecture 11: Dynamic Programming: All-Pairs Shortest Paths
Lecture 11: Dynamic Programming: All-Pairs Shortest Paths
In this lecture, Professor Demaine covers different algorithmic solutions for the All-Pairs Shortest Paths problem.
3 Jan 2017
•
1hr 21mins
Ranked #4
Recitation 5: Dynamic Programming
Recitation 5: Dynamic Programming
In this recitation, problems related to dynamic programming are discussed.
3 Jan 2017
•
52mins
Most Popular Podcasts
The Joe Rogan Experience
TED Talks Daily
The Tim Ferriss Show
The Daily
Stuff You Should Know
Oprah's SuperSoul Conversations
Armchair Expert with Dax Shepard
Ranked #5
On the Challenge of Assessing Students' Abiliites to Apply Algorithms in New and Creative Ways
On the Challenge of Assessing Students' Abiliites to Apply Algorithms in New and Creative Ways
In this video, the instructor discusses assessment strategies used in the course and the challenge of assessing students... Read more
3 Jan 2017
•
2mins
Ranked #6
Lecture 12: Greedy Algorithms: Minimum Spanning Tree
Lecture 12: Greedy Algorithms: Minimum Spanning Tree
In this lecture, Professor Demaine introduces greedy algorithms, which make locally-best choices without regards to the ... Read more
3 Jan 2017
•
1hr 22mins
Ranked #7
Lecture 8: Randomization: Universal & Perfect Hashing
Lecture 8: Randomization: Universal & Perfect Hashing
In this lecture, Professor Demaine reviews hashing in the context of randomized algorithms.
3 Jan 2017
•
1hr 21mins
Ranked #8
Lecture 9: Augmentation: Range Trees
Lecture 9: Augmentation: Range Trees
In this lecture, Professor Demaine covers the augmentation of data structures, updating common structures to store addit... Read more
3 Jan 2017
•
1hr 24mins
Ranked #9
Engaging Students
Engaging Students
In this video, the instructor suggests that one of the best ways to engage learners with the content is to communicate o... Read more
3 Jan 2017
•
Ranked #10
Lecture 20: Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees
Lecture 20: Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees
In this lecture, Professor Lynch introduces asynchronous distributed algorithms.
3 Jan 2017
•
1hr 12mins
Ranked #11
Lecture 19: Synchronous Distributed Algorithms: Symmetry-Breaking
Lecture 19: Synchronous Distributed Algorithms: Symmetry-Breaking
In this lecture, Professor Lynch introduces synchronous distributed algorithms.
3 Jan 2017
•
1hr 17mins
Ranked #12
Recitation 9: Approximation Algorithms: Traveling Salesman Problem
Recitation 9: Approximation Algorithms: Traveling Salesman Problem
In this recitation, problems related to approximation algorithms are discussed, namely the traveling salesman problem.
3 Jan 2017
•
31mins
Ranked #13
Lecture 18: Complexity: Fixed-Parameter Algorithms
Lecture 18: Complexity: Fixed-Parameter Algorithms
In this lecture, Professor Demaine tackles NP-hard problems using fixed-parameter algorithms.
3 Jan 2017
•
1hr 17mins
Ranked #14
Lecture 17: Complexity: Approximation Algorithms
Lecture 17: Complexity: Approximation Algorithms
In this lecture, Professor Devadas introduces approximation algorithms in the context of NP-hard problems.
3 Jan 2017
•
1hr 21mins
Ranked #15
Recitation 8: NP-Complete Problems
Recitation 8: NP-Complete Problems
In this recitation, problems related to NP-Completeness are discussed.
3 Jan 2017
•
45mins
