Algorithms
  SYLLABUS

For the detailed 2018-1 Syllabus in Spanish visit https://sites.google.com/a/unal.edu.co/algoritmos-2018-1

GOAL

Provide elements that allows the student to analyze and to design efficient algorithms.

METHODOLOGY

GRADING

Vsit https://sites.google.com/a/unal.edu.co/algoritmos-2018-1

 

BIBLIOGRAPHY


Sanjoy Dasgupta,
Christos Papadimitriou, Umesh Vazirani,"Algorithms" ,McGraw Hill, 2007. Book Website

Cormen T.H., Leiserson C.E., Rivest R.L. and Stein C., “Introduction to Algorithms”, MIT Press 2009.Book Website 

Introdcution to Algorithms MIT Open Course Ware and Academicearth

Udacity CS212 Design of Comoputer Programs Peter Norvig, Google

Coursera Algorithms, Part I, Kevin Wayne and Robert Sedgewick, Princeton University

Coursera Algorithms, Part II, Kevin Wayne and Robert Sedgewick, Princeton University

Coursera Algorithms: Design and Analysis, Part 1 Tim Roughgarden, Stanford University

Coursera Algorithms: Design and Analysis, Part 2 Tim Roughgarden, Stanford University

Coursera Analysis of Algorithms, Robert Sedgewick, Princeton University

Coursera Bioinformatics Algorithms (Part 1), Pavel Pevzner, Phillip E. C. Compeau and Nikolay Vyahhi, University Califonaia San Diego

Skiena, S. S. and Revilla, M. A. 2003. Programming challenges: the programming contest training manual. Springer-Verlag.

Skiena, S. S. and Revilla, M. A. 2003. Programming challenges: the programming contest training manual. Springer-Verlag.

Harel D, Feldman Y. Algorithmics: The Spirit of Computing (3rd Edition). Addison Wesley; 2004.

MT Goodrich, R Tamassia. 2002. Algorithm design: foundations, analysis, and Internet examples. Wiley.

Bentley, J. 2000 Programming Pearls (2nd Ed.). ACM Press/Addison-Wesley Publishing Co.

Sara Baase and Allen Van Gelder, "Computer Algorithms: Introduction to Design and Analysis" Addison-Wesley Pub Co; 3rd edition 1999. 

Brassard, G. and P. Bratley., “Fundamentals of Algorithmics”, Englewood Cliffs, N.J. : Prentice Hall, 1996. (Available in the Engineering Libray)  (Available in Spanish: Brassard G. y. Bratley P. “Fundamentos de Algoritmia”, Prentice Hall, 1997.)

Algorithmica: An international Journal in computer science. Springer Verlag. (Available in the Engineering and Math Libraries)

Hofri Michael, Analysis of Algorithms: Mathematical and Compuational Methods, Oxford, 1995.

Herbert Wilf on line available books on "Algorithms and Complexity" and "Generatingfunctionology" http://www.math.upenn.edu/~wilf

Aho, A., J. Hopcroft and J. Ullman., "The Design and Analysis of Computer Algorithms", 2da Ed., Addison-Wesley, 1974. (Available in the Engineering Libray)

Knuth, D.E., “The art of computer programming”. Addison-Wesley. 2. ed .Vols 1 Fundamental algorithms – v.2. Seminumerical algorithms - Vols.3-4 . Sorting and searching , 1973. (Available in the Math Libray)

Brassard, G. and P. Bratley., "Algorithmics. Theory and Practice", Prentice-Hall, 1988.

Sedgewick R. and Flajolet P. “An Introduction to the Analysis of Algorithms”. Addison-Wesley, 1996. 

Parberry I., “Problems on algorithms”, Englewood Cliffs, N.J. : Prentice Hall, 1995.

Tarjan R.E., “Data structures and network algorithms”, Philadelphia, Pennsylvania : Society for Industrial and Applied Mathematics, 1983. 

Sedgewick R., “Algorithms”, Reading, Mass. : Addison-Wesley, 1983.

Manber U., “Introduction to algorithms : a creative approach”, Reading, Mass. : Addison-Wesley Publishing Company, 1989.

Motwani R. and Raghavan P., "Randomized Algorithms" . Cambridge University Press 1997. 

Probability and Algorithms. National Academy Press, 1992. http://books.nap.edu/books/0309047765/html/index.html

 

Home