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
26
  • R10. Distributed 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
27
  • R11. Cryptography: More Primitives (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
28
  • R2. 2-3 Trees and B-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
29
  • R4. Randomized Select and Randomized 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
30
  • R5. Dynamic Programming (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
31
  • R6. Greedy 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
32
  • R7. Network Flow and 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
33
  • R8. NP-Complete Problems (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
34
  • R9. Approximation Algorithms: Traveling Salesman Problem (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