Bibliography

[AHU74]

Aho, A.V., Hopcroft J.E., Ullman J.D., "The Design and Analysis of Computer Algorithms", Reading, MA: Addison-Wesley; 1974.

[AHU83]

Aho, A.V., Hopcroft J.E., Ullman J.D., "Data Structures and Algorithms", Reading, MA: Addison-Wesley; 1983.

[Baa88]

Baase S., "Computer ALgorithms. Introduction to Design and Analysis", Reading, MA: Addison-Wesley; 1988.

[BB93]

Brassard, G., Bratley, P., "Algorithmik: Theorie und Praxis", Attenkirchen: Wolfram; 1993.

[BKR91]

Banachowski, L., Kreczmar, A., Rytter, W., "Analysis of Algorithms and Data Structures", Reading, MA: Addison-Wesley; 1991.

[Bli94]

Blieberger, J., "Discrete Loops and Worst Case Performance", Computer Languages, Vol. 20, No. 3, pp. 193-212, 1994.

[Dro82]

Dromey, R.G., "How to Solve it by Computer", Prentice-Hall Inc.; 1982.

[GKP89]

Graham, R.L., Knuth, D.E. and Patashnik, O., "Concrete Mathematics", Reading, MA: Addison-Wesley; 1989.

[Hel86]

Helman, Veroft, "Intermediate Program Solving and Data Structures", Menlo Park, CA: The Benjamin Cummings Publishing Company, Inc.; 1986.

[Hor78]

Horowitz, E., Sahni, S., "Fundamentals of Computer Algorithms", Computer Science Press, Inc.; 1978.

[Knu73a]

Knuth, D.E., "Fundamental Algorithms", Reading, MA: Addison-Wesley; 1973.

[Knu73b]

Knuth, D.E., "The Art of Computer Programming, Volume 3: Sorting and Searching", Reading, MA: Addison-Wesley; 1973.

[Meh84]

Mehlhorn, K., "Data Structures and Algorithms 1: Sorting And Searching", Heidelberg: Springer-Verlag Berlin; 1984.

[Oli93]

Oliver I., "Programming classics", Prentice Hall; 1993.

[Ott93]

Ottmann, T., Widmayer, P. "Algorithmen und Datenstrukturen", Mannheim; Leipzig; Wien; Zürich: BI-Wiss.-Verl.; 1993.

[Sav76]

Savage, J. E., "The Complexity of Computing", New York: John Wiley and Sons; 1976.

[Sed88]

Sedgewick, R. "Algorithms". Reading, MA: Addison-Wesley; 1988.

[Wyk88]

Van Wyk, C.J., "Data Structures and C Programs", Reading, MA: Addison-Wesley; 1988.

[ Samples Overview | WOOP Project ]