1 Classes at University of Athens
K09 – Discrete Math
Summary
Introduction to the following concepts: Sets, Mathematical logic and iduction, binary relations, functions, combinations and permutations, discrete probability distributions, conditional probability, independent events, Bayes theorem, asymptotic behavior of arithmetic functions. Seminar exercises are given as well as a final test.
2 Classes at UW-Madison
CS 787 – Advanced Algorithms
(Spring 2022, Spring 2020, Fall 2019)
Summary
Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.
CS 880 – Topics in Algorithmic Game Theory and Machine Learning
Summary
How to design algorithms when inputs are given by strategic or malicious people and the outputs affect them directly? Topics include: Concepts from Game Theory Learning Dynamics and Convergence in Games Mechanism Design without money and Social Choice Theory Mechanism Design with Money Concepts from Learning Theory Optimization from Samples Learning under Adversarial or Strategic Inputs
CS 577 – Introduction to Algorithms
(Spring 2021, Spring 2020, Fall 2018)
Summary
Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.