This is a static snapshot of the website of MPLA, taken on 2025-02-27.
You are here: Teachers » Aristeidis T. Pagourtzis

Aristeidis T. Pagourtzis

Aristeidis T. Pagourtzis

Member of the special inter-departmental committee
Member of the special inter-departmental committee
  • Assistant Professor, School of Electrical and Computer Engineering, NTUA

courses given

Course Semester
Π09Γ. Advanced topics in algorithms and complexity 2016-2017, spring semester
Π03Ε. Network algorithms and complexity 2016-2017, spring semester
Λ4. Algorithms and complexity II 2016-2017, fall semester
Π02Γ. Cryptography and complexity 2016-2017, fall semester
Λ4. Algorithms and complexity II 2015-2016, fall semester
Π02Γ. Cryptography and complexity 2015-2016, fall semester
Π03Ε. Network algorithms and complexity 2014-2015, spring semester
Λ4. Algorithms and complexity II 2014-2015, fall semester
Π02Γ. Cryptography and complexity 2014-2015, fall semester
Π09Γ. Advanced topics in algorithms and complexity 2013-2014, spring semester
Π03Ε. Network algorithms and complexity 2013-2014, spring semester
Λ4. Algorithms and complexity II 2013-2014, fall semester
Π03Ε. Network algorithms and complexity 2012-2013, spring semester
Λ4. Algorithms and complexity II 2012-2013, fall semester
Π02Γ. Cryptography and complexity 2012-2013, fall semester
Π03Α. Structural complexity 2011-2012, spring semester
Π11Β. Network algorithms: distributed, probabilistic, approximation 2011-2012, spring semester
Π03Ε. Network algorithms and complexity 2008-2009, spring semester
Π02Γ. Cryptography and complexity 2008-2009, fall semester
Π03Α. Structural complexity 2007-2008, spring semester
Π03Ε. Network algorithms and complexity 2007-2008, spring semester
Π02Γ. Cryptography and complexity 2007-2008, fall semester
Π03Ε. Network algorithms and complexity 2006-2007, spring semester
Π07Β. Advanced databases: algorithms and complexity 2006-2007, spring semester
Π02Γ. Cryptography and complexity 2006-2007, fall semester
Π03Ε. Network algorithms and complexity 2005-2006, spring semester
Π03Ε. Network algorithms and complexity 2004-2005, spring semester
Λ4. Algorithms and complexity II 2003-2004, spring semester
Π03Ε. Network algorithms and complexity 2003-2004, fall semester
29 courses.

seminars given

date title
2011/05/13 Distributed broadcasting with few transmissions in ad hoc radio networks
2009/02/13 Randomized and Approximation Algorithms for a New Matching Problem
2003/01/10 Communication algorithms in wireless networks of unknown topology
1998/06/12 Algorithms for graph coloring with applications in optical networks
4 seminars.

MSc theses supervised

title student defense
Triangulation Problems on Geometric Graphs - Sampling over Convex Triangulations Alexandros Angelopoulos 2017-11-10
Ηλεκτρονικές Ψηφοφορίες Ανθεκτικές σε Εκβιασμούς Panagiotis Kalogeropoulos 2017-11-08
Transfer k-means Pelagia Teloni 2017-06-26
Counting below #P: Classes, problems and Descriptive Complexity Aggeliki Chalki 2016-09-12
Smart contracts and Payments using Bitcoin and Ethereum Aikaterini-Panagiota Stouka 2015-05-06
Centralized protocols and anonymous decentralized systems Nikolaos Lamprou 2015-05-06
Counting complexity: compressed Hamming distance, vertex covers, and recent highlights Ioannis Nemparis 2015-05-04
Strategyproof Allocation of Multidimensional Tasks on Clusters