COT 5407: Introduction to Algorithms -- Fall 08
Course Homepage
Class: Room ECS 135; Tue-Thu: 5:00 to 6:15 PM
Office: ECS 254A; Phone: (305) 348-3748;
Office Hours: Tue 10-11 AM; Thu 3-4 PM
e-mail: giri@cis.fiu.edu
Graduate Assistant: TBA
FIU-SCIS ONLINE
COURSE MOODLE WEBSITE: COT5407FA08U01
ANNOUNCEMENTS
- Sep 02 Remember that your course material is at the SCIS online website at:
click here:
COT5407FA08U01. If you are unable to log into the website, email me.
- Aug 20 There will be no class on Aug 26 and Aug 28, since
I will be away at a conference. Your first class will begin on Sep 2.
USEFUL LINKS
TEXT:
Standard Text
"Introduction to Algorithms", (Second Edition) by Cormen, Leiserson, Rivest, Stein
[ISBN 0-07-013151-1] (McGraw Hill) and [ISBN 0-262-03293-7] (MIT Press)
This book is published by both MIT Press and McGraw Hill Publishers with different
ISBN numbers! Both versions have the exact same content. You may want to find a
copy with a CD-ROM containing Java implementations of the algorithms from the book.
Other Useful Books
- Algorithms in C++ (Parts 1-4; Part 5), by Sedgewick
- Data Structures, Algorithms, and Applications in Java, by Sahni.
- Computer Algorithms S. Baase and A. van Gelder, 3rd
Edition, Addison Wesley, 2000. ISBN: 0-201-61244-5.
- Computers and Intractability: A Guide to the Theory of
NP-Completeness, by M. Garey and D.S. Johnson, 1979
(Publishers: W. H Freeman and Company).
- Algorithm Design, by Kleinberg and Tardos.
- Approximation Algorithms for NP-hard Problems, by Dorit Hochbaum,
PWS Publishing Co., 1997.
- Computational Geometry, by de Berg, van Kreveld,
Overmars, Schwazkopf
- Randomized Algorithms, by Motwani and
Raghavan
- Algorithm on Strings, Trees, and Sequences, by Gusfield
- Handbook of Discrete and Computational
Geometry, by Goodman and O'Rourke
- Combinatorial Optimization, by
Papadimitriou and Steiglitz
- Algorithms, by Dasgupta, Papadimitriou, and Vazirani
SYLLABUS
- Sorting and Order Statistics
- Balanced Trees
- Augmented Data Structures
- Dynamic Programming & Greedy Algorithms
- Graphs & Graph Algorithms
- String Algorithms
- Geometric Algorithms
- NP-Completeness
- Lower Bound Arguments
- Experimental Algorithmics
Last modified: Thu Oct 16 13:56:28 EDT 2008