Search for contacts, projects,
courses and publications

Algorithms & Complexity

Description

Algorithms are fundamental to computer science. They are the essence of computer programs and they lie at the core of any software system. This course will cover fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their performance. The contents include greedy algorithms, divide and conquer algorithms, dynamic programming, network flow, NP completeness and computational intractability, approximation algorithms, and randomized algorithms. Techniques on algorithm design and analyisis will be developed by drawing on problems from across many areas of computer science and related fields.

 

REFERENCES

  • Algorithm Design; J. Kleinberg and E. Tardos, Addison-Wesley 2005 Useful reference (not required): Introduction to Algorithms, (3rd Edition), by T. Cormen, C. Leiserson, R. Rivest, and C. Stein, McGraw Hill, 2009.

People

 

Papadopoulou E.

Course director

Junginger K.

Assistant

Additional information

Semester
Spring
Academic year
2016-2017
ECTS
6
Education
Master of Science in Informatics, Core course, Lecture, 1st and 2nd year