CS 491 MH, Spring 2002
Meets 2:00-3:00 P.M. on Fridays in room 2222 DCL.
Theme: Top Ten Algorithms of the 20th Century (plus a few runners up)
Schedule
date speaker topic
Jan 22 Organizational meeting
Jan 25 Ryan Szypowski Krylov subspace methods
Feb 1 David Bunde Approximate cake cutting
Feb 8 Bill Cochran Integer relation detection
Feb 15 Vanessa Lopez Decompositions (eigenvalues)
Feb 22 Greg Mackey Quicksort
Mar 1 Rossana Castro QR iteration
Mar 8 Mike Parks Monte Carlo
Mar 15 Vijay Devatha FFT
Mar 22 Spring break
Mar 29 Rebecca Hartman-Baker Multigrid
Alfred Zhao Data compression
Apr 5 David Alber Fast multipole method
Apr 12 Chris Siefert Simplex method for LP
Apr 19 Hanna VanderZee Decompositions (linear systems)
Zhen Cheng K shortest paths
Apr 26 Gary Spieler Optimizing Fortran compiler
Previous Terms