Back to 498 Topics in Algorithms
Lectures
Recordings : Class transcribe : Mediaspace
  1. FFT (1/26/21): scribbles : notes
  2. FFT II (1/28/21): scribbles
  3. Sorting networks I (2/2/21): scribbles : notes
  4. Sorting networks II (2/4/21): scribbles
  5. Quick-Sort in expectation (2/9/21): scribbles : notes
  6. Quick-Sort w.h.p., nuts and bolts, treaps (2/11/21): scribbles : notes
  7. Fibonacci heaps (2/23/21): scribbles : Jeff's notes
  8. Lower bound on sorting (2/25/21): scribbles : notes
  9. Closest pair in linear time (3/2/21): scribbles : notes.
  10. Hoffman encoding and entropy (3/4/21): scribbles : notes.
  11. Random bit extraction (3/9/21): scribbles : notes I, notes II.
  12. Shannon theorem/Union find (3/11/21): scribbles, Notes on Shannon's theorem, notes on union find.
  13. Union-find analysis (3/23/21): scribbles : Jeff notes on union find.
  14. Matchings (3/25/21): scribbles : notes I
  15. Matchings II (3/30/21): scribbles : notes II.
  16. Mincut (4/1/21): scribbles : notes II.
  17. Mincut, Matchings III, and stable matchings (4/6/21): scribbles.
  18. 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