Special Topics in Algorithms

This course aims to introduce students to some special advanced topics in algorithms of great practical value.

Upon successful completion of this course, the students will be able to:

• Understand in depth the concept of parallel and multithreaded
• Familiarize themselves with the theoretical background and the techniques necessary in order to solve linear programming problems.
• Become proficient in the application of the Simplex algorithm.
• Understand some important elementary number-theoretic algorithm and the theoretical background of public key cryptosystems.
• Familiarize themselves with the concept of approximation and randomized algorithms.
• Grasp notions from the theory of Computational Complexity, such as reducibility, NP-completeness and the complexity classes P, NP and PSPACE.

This is an advanced course about special topics in Algorithms for undergraduate students. It covers the following topics:

• Basic concepts of parallel algorithms with emphasis on multithreaded algorithms and dynamic multithreading. Models for multithreaded computation. A multithreaded implementation of Merge Sort.
• Efficient algorithms for solving systems of linear equations and for matrix inversion.
• Introduction to linear programming, standard and slack forms. Formulation of problems into linear programs and transformation into standard and slack form. The Simplex algorithm. The notion of duality in linear programming.
• Zero sum games. Discrete and fast Fourier transform.
• Elementary number theoretic algorithms. Euclid’s greatest common divisor algorithm. Modular arithmetic and Solving modular linear equations. The Chinese remainder theorem. The RSA public key algorithm.
• Randomized algorithms, random variables and expected values. The Metropolis Algorithm and Simulated Annealing.
• Introduction to approximation algorithms. The vertex-cover problem. The traveling-salesman problem. The set-covering problem. A randomized approximation algorithm for MAX 3-SAT.
• The class P of polynomial problems and the class NP of polynomial-time verifiable problems. The concept of reducibility and NP-completeness. Some characteristic NP-complete problems. The class PSPACE.

1. “ΕΙΣΑΓΩΓΗ ΣΤΟΥΣ ΑΛΓΟΡΙΘΜΟΥΣ”, Cormen T.H., Leiserson C.E., Rivest R.L., Stein C., Εκδόσεις ΙΤΕ - Πανεπιστημιακές Εκδόσεις Κρήτης, ISBN 978-960-524-473-6, 2016
2. “ΣΧΕΔΙΑΣΜΟΣ ΑΛΓΟΡΙΘΜΩΝ”, Jon Kleinberg, Eva Tardos, Εκδόσεις Κλειδάριθμος ΕΠΕ, ISBN 978-960-461-207-9, 2009