Design and Analysis of Algorithms (2015)

Design and Analysis of Algorithms (2015)

Follow Design and Analysis of Algorithms (2015)
Share on
Copy link to clipboard

6.046 introduces students to the design of computer algorithms, as well as analysis of sophisticated algorithms. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Erik Demaine, Srinivas Devadas, Nancy Ann Lynch


    • Jan 3, 2017 LATEST EPISODE
    • infrequent NEW EPISODES
    • 1h 1m AVG DURATION
    • 39 EPISODES


    Search for episodes from Design and Analysis of Algorithms (2015) with a specific topic:

    Latest episodes from Design and Analysis of Algorithms (2015)

    Lecture 24: Cache-Oblivious Algorithms: Searching & Sorting

    Play Episode Listen Later Jan 3, 2017 77:41


    In this lecture, Professor Demaine continues with cache-oblivious algorithms, including their applications in searching and sorting.

    Lecture 23: Cache-Oblivious Algorithms: Medians & Matrices

    Play Episode Listen Later Jan 3, 2017 80:27


    In this lecture, Professor Demaine introduces cache-oblivious algorithms.

    Recitation 11: Cryptography: More Primitives

    Play Episode Listen Later Jan 3, 2017 49:30


    In this recitation, problems related to cryptography are discussed.

    Lecture 22: Cryptography: Encryption

    Play Episode Listen Later Jan 3, 2017 84:14


    In this lecture, Professor Devadas continues with cryptography, introducing encryption methods.

    Lecture 21: Cryptography: Hash Functions

    Play Episode Listen Later Jan 3, 2017 82:00


    In this lecture, Professor Devadas covers the basics of cryptography, including desirable properties of cryptographic functions, and their applications to security.

    Recitation 10: Distributed Algorithms

    Play Episode Listen Later Jan 3, 2017 50:18


    In this recitation, problems related to distributed algorithms are discussed.

    Lecture 20: Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees

    Play Episode Listen Later Jan 3, 2017 72:03


    In this lecture, Professor Lynch introduces asynchronous distributed algorithms.

    Lecture 19: Synchronous Distributed Algorithms: Symmetry-Breaking

    Play Episode Listen Later Jan 3, 2017 77:33


    In this lecture, Professor Lynch introduces synchronous distributed algorithms.

    Recitation 9: Approximation Algorithms: Traveling Salesman Problem

    Play Episode Listen Later Jan 3, 2017 31:59


    In this recitation, problems related to approximation algorithms are discussed, namely the traveling salesman problem.

    Lecture 18: Complexity: Fixed-Parameter Algorithms

    Play Episode Listen Later Jan 3, 2017 77:43


    In this lecture, Professor Demaine tackles NP-hard problems using fixed-parameter algorithms.

    Lecture 17: Complexity: Approximation Algorithms

    Play Episode Listen Later Jan 3, 2017 81:08


    In this lecture, Professor Devadas introduces approximation algorithms in the context of NP-hard problems.

    Recitation 8: NP-Complete Problems

    Play Episode Listen Later Jan 3, 2017 45:46


    In this recitation, problems related to NP-Completeness are discussed.

    recitation np complete
    Lecture 16: Complexity: P, NP, NP-completeness, Reductions

    Play Episode Listen Later Jan 3, 2017 85:25


    In this lecture, Professor Demaine introduces NP-completeness.

    Lecture 15: Linear Programming: LP, reductions, Simplex

    Play Episode Listen Later Jan 3, 2017 82:27


    In this lecture, Professor Devadas introduces linear programming.

    Recitation 7: Network Flow and Matching

    Play Episode Listen Later Jan 3, 2017 51:12


    In this recitation, problems related to Network Flow and Matching are discussed.

    Lecture 14: Incremental Improvement: Matching

    Play Episode Listen Later Jan 3, 2017 82:32


    In this lecture, Professor Devadas continues with the topic of network flow.

    Lecture 13: Incremental Improvement: Max Flow, Min Cut

    Play Episode Listen Later Jan 3, 2017 82:57


    In this lecture, Professor Devadas introduces network flow, and the Max Flow, Min Cut algorithm.

    Recitation 6: Greedy Algorithms

    Play Episode Listen Later Jan 3, 2017 22:24


    In this recitation, problems related to greedy algorithms are discussed.

    Lecture 12: Greedy Algorithms: Minimum Spanning Tree

    Play Episode Listen Later Jan 3, 2017 82:09


    In this lecture, Professor Demaine introduces greedy algorithms, which make locally-best choices without regards to the future.

    Lecture 11: Dynamic Programming: All-Pairs Shortest Paths

    Play Episode Listen Later Jan 3, 2017 81:49


    In this lecture, Professor Demaine covers different algorithmic solutions for the All-Pairs Shortest Paths problem.

    Lecture 10: Dynamic Programming: Advanced DP

    Play Episode Listen Later Jan 3, 2017 80:07


    In this lecture, Professor Devadas introduces the concept of dynamic programming.

    Lecture 9: Augmentation: Range Trees

    Play Episode Listen Later Jan 3, 2017 84:35


    In this lecture, Professor Demaine covers the augmentation of data structures, updating common structures to store additional information.

    Recitation 5: Dynamic Programming

    Play Episode Listen Later Jan 3, 2017 52:02


    In this recitation, problems related to dynamic programming are discussed.

    Lecture 8: Randomization: Universal & Perfect Hashing

    Play Episode Listen Later Jan 3, 2017 81:51


    In this lecture, Professor Demaine reviews hashing in the context of randomized algorithms.

    Lecture 7: Randomization: Skip Lists

    Play Episode Listen Later Jan 3, 2017 80:55


    In this lecture, Professor Devadas continues with randomization, introducing skip lists as a randomized data structure.

    Recitation 4: Randomized Select and Randomized Quicksort

    Play Episode Listen Later Jan 3, 2017 39:29


    In this recitation, problems related to Randomized Select and Randomized Quicksort are discussed.

    Lecture 6: Randomization: Matrix Multiply, Quicksort

    Play Episode Listen Later Jan 3, 2017 81:52


    In this lecture, Professor Devadas introduces randomized algorithms, looking at solving sorting problems with this new tool.

    Lecture 5: Amortization: Amortized Analysis

    Play Episode Listen Later Jan 3, 2017 75:53


    In this lecture, Professor Demaine introduces analysis techniques for data structures, and the implementation of algorithms based on this analysis.

    Lecture 4: Divide & Conquer: van Emde Boas Trees

    Play Episode Listen Later Jan 3, 2017 80:14


    In this lecture, Professor Demaine introduces the van Emde Boas Tree data structure and its uses.

    Recitation 2: 2-3 Trees and B-Trees

    Play Episode Listen Later Jan 3, 2017 30:45


    In this recitation, problems related to 2-3 Trees and B-Trees are discussed.

    Lecture 3: Divide & Conquer: FFT

    Play Episode Listen Later Jan 3, 2017 80:52


    In this lecture, Professor Demaine continues with divide and conquer algorithms, introducing the fast fourier transform.

    Recitation 1: Matrix Multiplication and the Master Theorem

    Play Episode Listen Later Jan 3, 2017 53:46


    In this recitation, problems related to matrix multiplication and weighted interval scheduling are discussed.

    Lecture 2: Divide & Conquer: Convex Hull, Median Finding

    Play Episode Listen Later Jan 3, 2017 80:34


    In this lecture, Professor Devadas introduces divide-and-conquer algorithms and problems that can be solved using divide-and-conquer approaches.

    Lecture 1: Course Overview, Interval Scheduling

    Play Episode Listen Later Jan 3, 2017 83:34


    In this lecture, Professor Devadas gives an overview of the course and introduces an algorithm for optimal interval scheduling.

    Co-Teaching the Course

    Play Episode Listen Later Jan 3, 2017 2:18


    In this video, the instructor shares his experience co-teaching the course.

    Engaging Students

    Play Episode Listen Later Jan 3, 2017 0:54


    In this video, the instructor suggests that one of the best ways to engage learners with the content is to communicate one's own excitement about algorithms.

    On the Challenge of Assessing Students' Abiliites to Apply Algorithms in New and Creative Ways

    Play Episode Listen Later Jan 3, 2017 2:37


    In this video, the instructor discusses assessment strategies used in the course and the challenge of assessing students' abilities to apply algorithms in new and creative ways.

    On Teaching Complex Content

    Play Episode Listen Later Jan 3, 2017 3:43


    In this video, the instructor shares approaches for teaching a topic that students often find difficult.

    Meet the Educator

    Play Episode Listen Later Jan 3, 2017 3:10


    In this video, the instructor discusses his role in the course, his interest in algorithms, and how teaching the class helps him understand algorithms at a deeper level.

    Claim Design and Analysis of Algorithms (2015)

    In order to claim this podcast we'll send an email to with a verification link. Simply click the link and you will be able to edit tags, request a refresh, and other features to take control of your podcast page!

    Claim Cancel