|
|
|
|
Advanced Algorithms - 40-765 |
- Credit: 3 Units
- Semester: Fall
- Group: 1
- Lecture Class:
Sundays & Tuesdays, 4:30-6:00pm
- Room:
CE 201
|
|
|
Text Book(s)
|
- T. Cormen, C. Leiserson, R. Riverst, and C. Stein, Introduction to Algorithms, 3rd edition, MIT Press, 2009. [CLRS]
- J. Kleinberg and E. Tardos, Algorithm Design, Addison Wesley, 2005. [KT]
- R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995. [MR]
- M. Mitzenmacher and E. Upfal, Probability and Computing, Cambridge University Press, 2005. [MU]
- V. Vazirani, Approximation Algorithms, Springer-Verlag, 2001. [V]
- A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998. [BE]
- M. de Berg, O. Cheong, M. van Kreveld, M. Overmars, Computational Geometry: Algorithms and Applications, 3rd edition, Springer, 2008. [BCKO] |
|
|
|
|
Evaluation [Grading Policy ]
|
Midterm: 20% (1 Azar)
Final: 30% (29 Dey)
Assignments: 30%
Final Project: 20%
See the complete course syllabus here.
|
|
|
|
