4.7 To Probe Further

1.

Alfred V Aho, John E. Hopcroft, and Jeffrey D Ullman. Data Structures and Algorithms. Addison-Wesley, 1983.

2.

Gilles Brassard and Paul Bratley. Fundamentals of Algorithmics. Prentice-Hall, 1996. Indian Edition published by Prentice Hall of India, 1998.

3.

Thomas H. Cormen, Charles E. Leiserson, and Donald L. Rivest. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series, 1990. Indian Edition published in 1999.

4.

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

5.

Robert L. Kruse, Bruce P. Leung, and Clovis L. Tondo. Data Structures and Program design in C. Prentice Hall, 1991. Indian Edition published by Prentice Hall of India, 1999.

6.

Mark Allen Weiss. Data Structures and Algorithm Analysis in C++. Benjamin-Cummings, 1994. Indian Edition published in 1998.

7.

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

8.

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

9.

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

10.

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

11.

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.

12.

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

13.

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

14.

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

15.

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

16.

David A Huffman. A method for the construction of minimum-redundancy codes. Proceedings of the IRE Volume 40, Number 9, pp. 1098-1101, 1952.

17.

Daniel D Sleator and Robert E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, Volume 32, Number 3, pp 652-686, 1985.

18.

Robert E. Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, Volume 6, Number 2, pp.306-318, 1985.