Все публикации

0:47:57

Lecture 39: Review II

0:41:20

Lecture 38: Review I

0:49:06

Lecture 37: Advanced Topics II (P vs NP)

2:13:20

Lecture 36: Advanced Topics I: Linear Programming and Random Projections

0:43:51

[Walkthrough] Homework 10: Fun with MSTs, Flows, and Cuts

0:50:45

Lecture 35: Deferred Acceptance Matching Algorithm

0:50:40

Lecture 34: Max Flow, Minimum Cuts II

0:50:28

Lecture 33: Minimum s-t cut and Maximum Flow

1:25:45

[Walkthrough] Homework 9: Fun with Greedy

0:51:06

Lecture 32: Kruskal's Algorithm

0:50:30

Lecture 31: Minimal Spanning Trees

0:45:10

Lecture 29: Quiz Review Part II

0:32:57

Lecture 30: Scheduling and Huffman Coding

1:36:43

[Walkthrough] Homework 8: Fun with Dynamic Programming

0:43:59

Lecture 29: Quiz Review

0:52:18

Lecture 28: Activity Selection and Scheduling

0:48:13

Lecture 27: Dynamic Programming V

1:21:38

[Walkthrough] Homework 7: More Fun with Graphs and Dynamic Programming

0:56:34

Lecture 26: Dynamic Programming IV - LCS and Unbounded Knapsack

0:51:04

Lecture 25: Dynamic Programming III

0:52:10

Lecture 24: Dynamic Programming II with Floyd-Warshall

0:50:49

Lecture 23: Bellman Ford

1:08:58

[Walkthrough] Homework 6: Fun with Graphs

0:49:12

Lecture 21: Dijkstra's Algorithm