-
1.Alfred V. Aho, John E. Hopcroft,
and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms.
Addison-Wesley, 1974.
|
-
2.Alfred V. Aho, John E. Hopcroft,
and Jeffrey D. Ullman. Data Structures and Algorithm. Addison-Wesley,
1983.
|
-
3.Jon Bentley. Programming Pearls.
Addison-Wesley, 1986.
|
-
4.Jon Bentley. More Programming
Pearls. Addison-Wesley, 1988.
|
-
5.Gilles Brassard e Paul
Bratley. Algorithmics: Theory and Practice. Prentice-Hall, 1988.
|
-
6.Cormen, Leiserson, Rivest.
Introduction to Algorithms. MIT Press, 1990.
|
-
7. M. Garey e D. Johnson.
Computers and Intractability: A Guide to the Theory of NP-Completeness.
W.H. Freeman, 1979.
|
-
8.Donald E. Knuth. The Art of
Computer Programming. Addison-Wesley. Volume 3: Sorting and Searching,
1998.
|
-
9. R. Motwani e P. Raghavan.
Randomized Algorithms. Cambridge University Press, 1995.
|
-
10.Robert Sedgewick. Algorithms.
Second edition. Addison-Wesley, 1988.
|
-
11. Robert Sedgewick, Philippe
Flajolet. An Introduction to the Analysis of Algorithms, Addison-Wesley,
1995.
|