6.3 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.

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

5.

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

6.

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

7.

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

8.

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

9.

Mark R. Brown. Implementation and analysis of binomial queue algorithms. SIAM Journal on Computing, Volume 7, Number 3, pp. 298-319, 1978.

10.

Michael L. Fredman and Robert E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, Volume 34, Number 3, pp. 596-615, 1987.

11.

Robert W. Floyd. Algorithm 245 (TreeSort). Communications of the ACM, Volume 7, pp.701, 1964.

12.

Jean Vuillemin. A data structure for manipulating priority queues. Communications of the ACM, Volume 21, Number 4, pp.309-315, 1978.

13.

J.W.J. Williams. Algorithm 232 (Heapsort). Communications of the ACM, Volume 7, pp.347-348, 1964.