T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, Second Edition, Prentice-Hall India, 2003.

A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addision-Wesley, 1983.

F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, New York, NY, Springer-Verlag, 1985.

Data Structures and Algorithms: Volumes I, II and III by Kurt Mehlhorn, Springer-Verlag.

J. Kleinberg and E. Tardos, Algorithm design, Pearson education, 2006.

V. Vazirani, Approximation algorithms, Springer, 2003.

B. Chazelle, The discrepancy method: Randomness and complexity, Cambridge University Press, 2000.

Udi Manber, Introduction to algorithms: A creative approach, Addision-Wesley, 1989.

M. Molloy and B. Reed, Graph colouring and the probabilistic method, Springer, 2002.

Ketan Mulmuley, Computational Geometry: An Introduction Through Randomized Algorithsm, Prentice Hall, 1994.

R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press, 1995.

-----------------------------------------------

There will be three lectures and one tutorial per week, LTP 3-1-0, 4 credits.

Considerable stress will be given on class tests and home assignments.

----------------------------------------------------