Back to 498 Topics in Algorithms
Lectures
Recordings
:
Class transcribe
:
Mediaspace
- FFT (1/26/21): scribbles :
notes
- FFT II (1/28/21):
scribbles
- Sorting networks I (2/2/21):
scribbles :
notes
- Sorting networks II (2/4/21):
scribbles
- Quick-Sort in expectation (2/9/21):
scribbles :
notes
- Quick-Sort w.h.p., nuts and bolts, treaps (2/11/21):
scribbles :
notes
- Fibonacci heaps (2/23/21):
scribbles :
Jeff's notes
- Lower bound on sorting (2/25/21):
scribbles :
notes
- Closest pair in linear time (3/2/21):
scribbles :
notes.
- Hoffman encoding and entropy (3/4/21):
scribbles :
notes.
- Random bit extraction (3/9/21):
scribbles :
notes I,
notes II.
- Shannon theorem/Union find (3/11/21):
scribbles,
Notes on Shannon's theorem,
notes on union find.
- Union-find analysis (3/23/21):
scribbles :
Jeff notes on union find.
- Matchings (3/25/21):
scribbles :
notes I
- Matchings II (3/30/21):
scribbles :
notes II.
- Mincut (4/1/21):
scribbles :
notes II.
- Mincut, Matchings III, and stable matchings (4/6/21):
scribbles.
- Planar graphs I (4/8/21):
scribbles.
notes.
Academic calendar info
Instruction ends: May 5.
Last modified: Mon 2021-04-12 17:30:45 UTC 2021 by Sariel Har-Peled