CSE 589, Autumn 1997

Lectures Live on the Internet

To view the live lecture with Microsoft Netshow, install the free Netshow client, then at 6:30 on Wednesdays during Fall quarter click here to start the program.
Links to VXtreme on-demand versions of the lectures will be posted beneath the individual lecture headings as they are available.
More information about CSE 589 lectures on the internet.

Lecture Notes

  • 10/1/97: Intro, Dynamic Programming and Graph Algorithms
  • 10/8/97: Minimum Spanning Tree, Shortest Paths, Max-flow
  • 10/15/97: Max-flows, Generalizations, Linear Programming
  • 10/29/97: Linear Programming, NP-Completeness
  • 11/5/97: More on NP-Completeness
  • 11/12/97: Coping with NP-Completeness; Cryptography
  • 11/19/97: Hashing Schemes (Guest Lecture by Andrei Broder)
  • 11/26/97: More on Cryptography
  • 12/3/97: Still some more on Cryptography
  • 12/10/97: Some Final Thoughts....

    • Scribed notes

  • Lecture 1 : Scribed notes by Autry et. al . Here is the ps version.
  • Lecture 4: Scribed notes By Darren Robinson. Here is the ps version (1MB+) . pdf version (1MB+) . Sorry, no html.
  • Cryptography : Scribed notes By Charla Lambert. ps version (300KB+) . html version.