Brief Biography
Aris Pagourtzis is a Professor of Computer Science at the School of Electrical and Computer Engineering of NTUA and head of the Computer Science Division. He holds a Diploma in Electrical Engineering (1989) and a Ph.D. in Electrical and Computer Engineering (1999), both from the National Technical University of Athens. He has held academic posts at the University of Ioannina, the University of Liverpool, the ETH Zuerich, the University of Athens, and the Athens University of Economics and Business. He has coauthored four books on foundations of computer science, distributed computing and cryptography and more than eighty scientific publications. His main contributions lie in the areas of network algorithms, distributed computing, approximation algorithms, counting complexity and cryptography. He has served in the program and organizing committee of various theoretical computer science and cryptography conferences, co-chairing CIAC 2017 and FCT 2021. His research has often been funded by grants from the US, UK, France, EU, and national resources. He has been invited several times as a visiting researcher to universities in Europe and US, namely the University of Paris-Dauphine, the University of Liverpool, King’s College London, and the University of Rochester, among others.
Research Interests
Analysis of Algorithms and Problem Complexity • Graph algorithms • Complexity Measures and Classes • Approximation Algorithms • Combinatorial algorithms • Parallel and Distributed Algorithms • Network Algorithms • Cryptography
Publications
Publications LinkCourses
- Programming Techniques (Undergraduate - 2nd Semester)
- Foundations of Computer Science (Undergraduate - 3rd Semester)
- Algorithms and Complexity (Undergraduate - 7th Semester)
- Advanced Algorithms (Undergraduate - 8th Semester)
- Computational Cryptography (Undergraduate - 9th Semester)
- Theoretical Computer Science I: Algorithms and Complexity (Graduate - Fall Semester)
- Network Algorithms and Complexity (Graduate - Spring Semester)
- Theoretical Computer Science II: Parallel Algorithms and Complexity (Graduate - Spring Semester)