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

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.

5.

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

6.

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

7.

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

8.

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.

9.

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

10.

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

11.

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

12.

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

13.

G.M. Adel'son-Vel'skii and E.M. Landis. An algorithm for the organization of information. Soviet Mathematics Monthly, Volume 3, pp.1259-1263, 1962.

14.

R. Bayer. Symmetric binary B-trees: Data Structures and maintenance algorithms, Acta Informatica, Volume 1, pp.290-306, 1972.

15.

R. Bayer and E.M. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, Volume 1, Number 3, pp. 173-189, 1972.

16.

D. Comer. The ubiquitous B-tree. ACM Computing Surveys, Volume 11, Number 2, pp 121-137, 1979.

17.

William Pugh. Skip Lists: A probabilistic alternative to balanced trees. Communications of the ACM, Volume 33, Number 6, pp. 668-676, 1990.

18.

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

19.

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