Sessions

2. Divide & Conquer: Convex Hull, Median Finding

2. Divide & Conquer: Convex Hull, Median Finding

11 months ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Srinivas Devadas In this lecture, Professor Devadas introduces divide-and-conquer algorithms and problems that can be solved using divide-and-conquer approaches. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
24. Cache-Oblivious Algorithms: Searching & Sorting

24. Cache-Oblivious Algorithms: Searching & Sorting

11 months ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Erik Demaine In this lecture, Professor Demaine continues with cache-oblivious algorithms, including their applications in searching and sorting. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
7. Randomization: Skip Lists

7. Randomization: Skip Lists

11 months ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Srinivas Devadas In this lecture, Professor Devadas continues with randomization, introducing skip lists as a randomized data structure. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
14. Incremental Improvement: Matching

14. Incremental Improvement: Matching

11 months ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Srinivas Devadas In this lecture, Professor Devadas continues with the topic of network flow. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
R2. 2-3 Trees and B-Trees

R2. 2-3 Trees and B-Trees

11 months ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Amartya Shankha Biswas In this recitation, problems related to 2-3 Trees and B-Trees are discussed. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
18. Complexity: Fixed-Parameter Algorithms

18. Complexity: Fixed-Parameter Algorithms

11 months ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Erik Demaine In this lecture, Professor Demaine tackles NP-hard problems using fixed-parameter algorithms. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
R10. Distributed Algorithms

R10. Distributed Algorithms

11 months ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Ling Ren In this recitation, problems related to distributed algorithms are discussed. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
R6. Greedy Algorithms

R6. Greedy Algorithms

11 months ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Amartya Shankha Biswas In this recitation, problems related to greedy algorithms are discussed. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
23. Cache-Oblivious Algorithms: Medians & Matrices

23. Cache-Oblivious Algorithms: Medians & Matrices

11 months ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Erik Demaine In this lecture, Professor Demaine introduces cache-oblivious algorithms. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
15. Linear Programming: LP, reductions, Simplex

15. Linear Programming: LP, reductions, Simplex

11 months ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Srinivas Devadas In this lecture, Professor Devadas introduces linear programming. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
10. Dynamic Programming: Advanced DP

10. Dynamic Programming: Advanced DP

11 months ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Srinivas Devadas In this lecture, Professor Devadas introduces the concept of dynamic programming. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
1. Course Overview, Interval Scheduling

1. Course Overview, Interval Scheduling

11 months ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Srinivas Devadas In this lecture, Professor Devadas gives an overview of the course and introduces an algorithm for optimal interval scheduling. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu