Office: FEC 157, phone: 277-5446 The best way to reach me is generally via email.
Office Hours: Tuesdays and Thursdays 2:30-3:30 or by appointment.
Note: If I'm in my office and the door is open, feel free to come in. If the door is closed, I'm probably hard at work on a paper or grant or research problem. Please come by another time or make an appointment via email.
Teaching Assistant
Dandan Mo; Email: mdd at cs.unm.edu. Office: FEC 301A
Office Hours: Monday 10:00-11:30 and Weds 1:30-3:00PM
Class Info
The class meets Tuesdays and Thursdays, 3:00-4:45 in Dane Smith Hall Room 234.
Course Description
This class covers advanced topics in Algorithms and Data Structures with a focus on mathematical techniques, proofs and analysis. Topics to be covered will likely include the following: Randomized Algorithms: Rabin fingerprinting, data streaming algorithms, coupon collectors, birthday paradox, skip lists; Network Flow: Max Matchings, Min-cut Max-flow duality; Linear Programming, duality, and basic game theory; NP-Hardness and Approximation Algorithms.
Text Book
We will be using the book: ``Introduction to Algorithms (third edition)'' by Cormen, Leiserson, Rivest and Stein, in addition to supplemental material and occasional handouts.
Class E-mail List
Directions for subscribing to the class email list are here. This
link also contains an archive of the mailing list.
Note: Some of the material in these notes, including many examples and
figures are from Jeff Erickson's class notes for
CS373 at the
University of Illinois Urbana Champagne.