LEJ Knowledge Hub

Lecture

Right Arrow

SEARCH COURSES / LECTURES

Left Arrow

Design and Analysis of Algorithms (M-I-T)

(34 Lectures Available)

S# Lecture Course Institute Instructor Discipline
1
  • 1. Course Overview, Interval Scheduling (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
2
  • 10. Dynamic Programming: Advanced DP (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
3
  • 11. Dynamic Programming: All-Pairs Shortest Paths (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
4
  • 12. Greedy Algorithms: Minimum Spanning Tree (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
5
  • 13. Incremental Improvement: Max Flow, Min Cut (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
6
  • 14. Incremental Improvement: Matching (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
7
  • 15. Linear Programming: LP, reductions, Simplex (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
8
  • 16. Complexity: P, NP, NP-completeness, Reductions (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
9
  • 17. Complexity: Approximation Algorithms (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
10
  • 18. Complexity: Fixed-Parameter Algorithms (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
11
  • 19. Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
12
  • 2. Divide & Conquer: Convex Hull, Median Finding (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
13
  • 20. Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
14
  • 21. Cryptography: Hash Functions (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
15
  • 22. Cryptography: Encryption (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
16
  • 23. Cache-Oblivious Algorithms: Medians & Matrices (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
17
  • 24. Cache-Oblivious Algorithms: Searching &  (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
18
  • 3. Divide & Conquer: FFT (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
19
  • 4. Divide & Conquer: van Emde Boas Trees (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
20
  • 5. Amortization: Amortized Analysis (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
21
  • 6. Randomization: Matrix Multiply, Quicksort (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
22
  • 7. Randomization: Skip Lists (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
23
  • 8. Randomization: Universal & Perfect Hashing (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
24
  • 9. Augmentation: Range Trees (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
25
  • R1. Matrix Multiplication and the Master Theorem (M-I-T)
Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences

Basic and Health Sciences

Applied Sciences

Social Sciences