11.2 Useful Books

1.

Alfred V Aho, John E. Hopcroft, and Jeffrey D Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

2.

Sara Baase and Allen Van Gelder. Computer Algorithms: Introduction to Design and Analysis. Addison-Wesley, Third Edition, 2000. Indian Edition published by Pearson Education Asia, 2000.

3.

Duane A. Bailey. Java Structures: Data Structures in Java for the Principled Programmer. McGraw-Hill International Edition, 1999.

4.

Richard Bellman. Dynamic Programming. Princeton University Press, 1957.

5.

Jon L. Bentley. Writing Efficient Programs, Prentice-Hall, 1982.

6.

Jon L. Bentley. Programming Pearls, Addison-Wesley, 1986.

7.

Jon L. Bentley. More Programming Pearls, Addison-Wesley, 1988.

8.

Gilles Brassard and Paul Bratley. Algorithmics : Theory and Practice. Prentice-Hall, 1988.

9.

Michael R. Garey and David S Johnson. Computers and Intractability: A Guide to Theory of NP-Completeness. W.H. Freeman, 1979.

10.

R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-wesley, Reading, 1990. Indian Edition published by Addison-Wesley Longman, 1998.

11.

Ellis Horowitz and Sartaz Sahni. Fundamentals of Data structures. Galgotia Publications, New Delhi, 1984.

12.

Ellis Horowitz, Sartaz Sahni, and Rajasekaran. Fundamentals of Computer Algorithms. W.H. Freeman and Company, 1998. Indian Edition published by Galgotia Publications, 2000.

13.

Donald E Knuth. Fundamental Algorithms, Volume 1 of The Art of Computer Programming, Addison-Wesley, 1968, Second Edition, 1973.

14.

Donald E Knuth. Seminumerical Algorithms. Volume 2 of The Art of Computer Programming, Addison-Wesley, 1969, Second Edition, 1981.

15.

Donald E. Knuth. Sorting and Searching, Volume 3 of The Art of Computer Programming, Addison-Wesley, 1973.

16.

Y. Langsam, M.J. Augenstein, and A.M. Tenenbaum. Data Structures using C and C++. Second Edition, Prentice Hall, 1996. Indian Edition published by Prentice Hall of India, 2000.

17.

Eugene L Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B.Shmoys, editors. The Traveling Salesman Problem. John Wiley & Sons, 1985.

18.

Kurt Mehlhorn. Sorting and Searching. Volume 1 of Data Structures and Algorithms. Springer-Verlag, 1984.

19.

Kurt Mehlhorn. Graph Algorithms and NP-Completeness. Volume 2 of Data Structures and Algorithms, Springer-Verlag, 1984.

20.

Kurt Mehlhorn. Multidimensional Searching and Computational Geometry. Volume 3 of Data Structures and Algorithms, Springer-Verlag, 1984.

21.

Sartaj Sahni. Data Structures, Algorithms, and Applications in Java. McGraw-Hill Higher Education, 2000.

22.

Robert Sedgewick. Algorithms. Addison-Wesley, Second Edition, 1988.

23.

Thomas A. Standish. Data Structures in Java. Addison-Wesley, 1998. Indian Edition published by Addison Wesley Longman, 2000.

24.

Nicklaus Wirth. Data Structures + Algorithms = Programs. Prentice-Hall, Englewood Cliffs. 1975.