Return to Table of Contents Previous Chapter

REFERENCES

BALANCED TREES

[Aoe 91] Computer Algorithms: Key Search Strategies, (IEEE Computer Society Press), Edited by J. Aoe, 1991. ISBN 0-8186-2123-0.

[BayeMc 72] "Organization and maintenance of large ordered indexes," R. Bayer and C. McCreight, Acta Informatica, Vol. 1, No. 3, 1972, pp. 173-189.

[GuibaSedge 78] "A Dichromatic Framework for Balanced Trees," L. Guibas and R. Sedgewick, Proceedings of the 19th Annual Symposium on Foundations of Computer Science, IEEE, 1978.

[SleatorTar 85] Self-Adjusting Binary Search Trees, D. Sleator and R. Tarjan, Journal of the ACM, Vol. 32, No. 3, July, 1985, pp. 652-686.

C++ PROGRAMMING

[Coplien 92] Advanced C++ Programming Styles and Idioms, (Addison Wesley), J. Coplien, 1992. ISBN 0-201-54855-0.

[Stroustrup 91] The C++ Programming Language, 2nd Edition, (Addison Wesley), B. Stroustrup, 1991. ISBN 0-201-53992-6.

GENERAL ALGORITHMS AND DATA STRUCTURES

[Flamig 93] Practical Algorithms in C++, (John Wiley & Sons), B. Flamig, Fall, 1993.

[HoroSahni 90] Fundamentals of Data Structures in Pascal, 3rd Edition, (Computer Science Press), E. Horowitz and Sartaj Sahni, 1990. ISBN 0-7167-8217-0.

[Knuth 73] The Art of Computer Programming: Fundamental Algorithms, Vol. 1, (Addison Wesley), D. Knuth, 1973.

[Knuth 73b] The Art of Computer Programming: Sorting and Searching, Vol. 3, (Addison Wesley), D. Knuth, 1973. ISBN 0-201-03803-X.

[Lings 86] Information Structures: A uniform approach using Pascal, (Chapman and Hall Computing), B. Lings, 1986. ISBN 0-412-26500-1.

[Mohle 92] Private communications with M. Mohle about general design priciples for data structures and algorithms, 1992.

OBJECT-ORIENTED DESIGN

[Booch 91] Object Oriented Design with Applications, (The Benjamin/Cummings Publishing Company), G. Booch, 1991.

[RumbBla 91] Object-Oriented Modeling and Design, (Prentice Hall), J. Rumbaugh, M. Blaha, W. Premerlani, F. Eddy, and W. Lorenson, 1991.

PRIORITY QUEUES

[Atk 86] "Min-Max Heaps and Generalized Priority Queues," M. Atkinson, J. Sack, N. Santoro, and T. Strothotte, Communications of the ACM, Vol. 29, No. 10, October, 1986, pp. 996-1000.

[Jones 86] "An Empirical Comparison Of Priority-Queue and Event-Set Implementations," D. Jones, Communications of the ACM, Vol. 29, No. 4, April 1986, pp. 300-311.

Return to Table of Contents