LEJ Knowledge Hub

Lecture

Right Arrow

SEARCH COURSES / LECTURES

Left Arrow

Introduction to Algorithms (Fall 2005) (M-I-T)

(23 Lectures Available)

S# Lecture Course Institute Instructor Discipline
1
  • Lecture 10: Red-black Trees, Rotations, Insertions, Deletions (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
2
  • Lecture 11: Augmenting Data Structures, Dynamic Order Statistics, Interval Trees (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
3
  • Lecture 12: Skip Lists (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
4
  • Lecture 13: Amortized Algorithms, Table Doubling, Potential Method (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
5
  • Lecture 14: Competitive Analysis: Self-organizing Lists (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
6
  • Lecture 15: Dynamic Programming, Longest Common Subsequence (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
7
  • Lecture 16: Greedy Algorithms, Minimum Spanning Trees (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
8
  • Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
9
  • Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
10
  • Lecture 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
11
  • Lecture 1: Administrivia; Introduction; Analysis of Algorithms, Insertion Sort, Mergesort (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
12
  • Lecture 22: Advanced Topics (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
13
  • Lecture 23: Advanced Topics (cont.) (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
14
  • Lecture 24: Advanced Topics (cont.) (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
15
  • Lecture 25: Advanced Topics (cont.) - Discussion of Follow-on Classes (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
16
  • Lecture 2: Asymptotic Notation; Recurrences; Substitution, Master Method (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
17
  • Lecture 3: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
18
  • Lecture 4: Quicksort, Randomized Algorithms (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
19
  • Lecture 5: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
20
  • Lecture 6: Order Statistics, Median (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
21
  • Lecture 7: Hashing, Hash Functions (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
22
  • Lecture 8: Universal Hashing, Perfect Hashing (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences
23
  • Lecture 9: Relation of BSTs to Quicksort - Analysis of Random BST (M-I-T)
Introduction to Algorithms (Fall 2005) (M-I-T) MIT Prof. Charles Leiserson, Prof. Erik Demaine Applied Sciences

Basic and Health Sciences

Applied Sciences

Social Sciences