The class focuses on topics such as

• general principles of algorithm design,
• network flows,
• amortised analysis and advanced data structures,
• string matching,
• NP-completeness,
• approximation algorithms for hard problems,
• arithmetic algorithms and circuits, fast fourier transform.

• Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms, 2nd Ed. McGraw-Hill 2001
• Kleinberg, Tardos: Algorithm Design Addison-Wesley 2005.

Target audience

All Master and Bachelor students who are interested in algorithms.

Prerequisites

Basic familiarity with the design and analysis of algorithms.