Bibliografía básica

• T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein. Introduction to Algorithms, Second Edition, MIT Press, 2001.
• S. Dasgupta, C. Papadimitriou, U. Vazirani. Algorithms, McGraw-Hill, 2008.
• J. Kleinberg, E. Tardos. Algorithm Design, Addison-Wesley, 2005.
• R. Sedgewick. Bundle of Algorithms in C++, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition), Addison-Wesley, 2001.

Bibligrafía complementaria

• G. Brassard, P. Bratley. Fundamentos de Algoritmia, Prentice Hall, 1997.
• L. Lamport. LaTeX: A Document Preparation System (2nd ed), Addison-Wesley, 1994.
• D. Mehta (editor). Handbook of Data Structures and Applications, Chapman & Hall, 2004.
• M. Mitzenmacher, E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis, Cambridge Univ. Press, 2005.
• R. Motwani, P. Raghavan. Randomized Algorithms, Cambridge Univ. Press, 1995.
• I. Parberry and W. Gasarch. Problems on Algorithms (2nd edition).
• S. Skienna. The Algorithm Design Manual (2nd ed), Springer, 2010.
• M.A. Weiss. Data Structures and Algorithm Analysis in C++ (2nd Edition), Addison-Wesley, 1999.
• M.A. Weiss. Data Structures and Problem Solving Using C++ (Second Edition), Addison-Wesley, 2000.