Kent Quanrud - VideoAndMovie

Matchings

1:08:32

Matchings

Hashing and heavy hitters

1:14:30

Hashing and heavy hitters

Randomized rounding

1:17:17

Randomized rounding

Push-relabel

1:09:17

Push-relabel

Randomized searching and sorting

1:17:10

Randomized searching and sorting

Lazy data structures

1:15:32

Lazy data structures

Applications of flows and cuts

1:14:48

Applications of flows and cuts

Network flow

45:56

Network flow

Spanning trees

1:09:38

Spanning trees

NP-Completeness

54:57

NP-Completeness

Independent set and coloring

1:15:24

Independent set and coloring

The longest path

1:08:21

The longest path

Subset sum and the secret language of numbers

52:00

Subset sum and the secret language of numbers

2-SAT vs Max 2-SAT

1:08:06

2-SAT vs Max 2-SAT

SAT - A different kind of search problem

1:08:13

SAT - A different kind of search problem

Negative edge lengths and all pairs shortest paths

1:19:13

Negative edge lengths and all pairs shortest paths

Shortest paths

1:08:07

Shortest paths

Searching and sorting graphs

1:14:49

Searching and sorting graphs

Edit distance and matrix chain multiplication

1:15:53

Edit distance and matrix chain multiplication

Fast multiplication and Fourier transform

1:13:38

Fast multiplication and Fourier transform

Selection and closest pair

1:13:55

Selection and closest pair

Induction

1:20:06

Induction

Searching and sorting

1:06:34

Searching and sorting

Matchings and vertex cover

1:02:30

Matchings and vertex cover

Probabilistically checkable proofs

2:36:24

Probabilistically checkable proofs

Hashing and heavy hitters

1:23:35

Hashing and heavy hitters

Reducing randomization with random walks

1:34:19

Reducing randomization with random walks

Randomized rounding

1:36:55

Randomized rounding

Push-relabel

1:39:39

Push-relabel

Deterministic connectivity in logarithmic space

1:42:23

Deterministic connectivity in logarithmic space