The Design and Analysis of Algorithms
Tuesday and Thursday, 1:15-2:30 pm, D243 LSRC
This course introduces a number of algorithms that are theoretically
interesting and practically important. It also discusses design
paradigms, such as randomization and dynamic programming, and analysis
techniques, probabilistic analysis and amortization.
- Design Techniques
- Graph Algorithms
- Network Flow
- String Algorithms
There will be handouts and lecture notes avaliable after class. The main
text used in this course is
Tarjan, Data Structures and Network Algorithms, SIAM, 1983.
Cormen, Leiserson, Rivest and Stein,
Introduction to Algorithms, 2nd Edition, McGraw Hill, Boston, 2001.
Graham, Knuth and Patashink,
Concrete Mathmatics. A Foundation for Computer Science,
Addison Wesley, 1988.