Resources

This page will be the central repository for materials used in the course, important auxiliary information, useful additional notes, tips, how-to's, and even useless but fun materials or links that are relevant to some of the topics we covered in the course.

Have fun exploring!

 

Slides and Notes

• Slides
• Animated PPT versions of Flow slides
  • Introduction to Flow
  • Flow Algorithm Demo
  • Flow applications
• Misc. Notes
  • Using MST to approximate TSP
  • Linear time median finding.
  • Batcher's Odd/Even mergesort.
  • Exponentiation
  • Inductive Proofs of Correctness for Recursive Algorithms
  • Dynamic programming & edit distance from Jeff Erickson notes

Homeworks

• Homeworks

Exams

• Exams

Auxiliary Handouts

• Solving Recurrences
• On Writing Proofs
• Induction
• Discrete Math Mistakes
• Pessimal Algorithms and Simplexity Analysis is an amusing paper by Broder and Stolfi. Find out what CS theorists do when on Friday nights!
• Proof Techniques by Dana Angluin provides a more realistic view of the tools of the trade.
• Giving Talks (by Cormen)
• How to present a CS paper (by Parberry)
• Game Theory
• Others

Lecture Notes of Other Algorithms Courses

• Combinatorial Algorithms taught by Jeff Erickson @ UIUC
• Efficient Algorithms and Intractable Problems taught by Luca Trevisan @ UC Berkeley

LaTeX Tutorials

• Text Processing using LaTeX

Women in CS and Engineering:

• Women in Computer Science