Agamemnon Giannakopoulos: student profile
msc
| Enrolled in: | March 2012 |
|---|---|
| Graduated on: | Tuesday, 18 Jul 2017 |
| Chosen specialization: | logic and the theory of algorithms and computation |
Thesis
Title: Learning Poisson Binomial Distributions with Differential Privacy.
Defended: Tuesday, 28 Feb 2017.
Course participations
- Λ2. Computability (2012-2013, fall semester)
- Λ3. Algorithms and complexity I (2012-2013, fall semester)
- Λ4. Algorithms and complexity II (2012-2013, fall semester)
- Π02Γ. Cryptography and complexity (2012-2013, fall semester)
- Π02Ε. Computational algebra (2012-2013, fall semester)
- Λ13Ο. Approximation algorithms and mechanisms design (2012-2013, spring semester)
- Π03Ε. Network algorithms and complexity (2012-2013, spring semester)
- Π00Γ. Combinatorial optimization (2013-2014, fall semester)
- Λ4. Algorithms and complexity II (2013-2014, fall semester)
- Π03Ξ. Approximation algorithms (2013-2014, spring semester)
- Λ5. Research methodology (2015-2016, spring semester)
- ΛΔΕ. Msc thesis (2015-2016, spring semester)
- Λ5. Research methodology (2016-2017, spring semester)
- ΛΔΕ. Msc thesis (2016-2017, spring semester)
Exam results
Final grades
| Course | Mark | Credits | |
|---|---|---|---|
| Λ1. | mathematical logic | 6.0 | 4 |
| Λ2. | computability | 8.0 | 4 |
| Λ3. | algorithms and complexity I | 6.0 | 4 |
| Λ4. | algorithms and complexity II | 8.0 | 4 |
| Μ6. | set theory | 7.0 | 4 |
| Π17. | mathematics and cryptography | 10.0 | 4 |
| Π00Γ. | combinatorial optimization | 8.0 | 4 |
| Π02Γ. | cryptography and complexity | 8.0 | 4 |
| Π02Ε. | computational algebra | 10.0 | 4 |
| Π03Ε. | network algorithms and complexity | 9.5 | 4 |
| GPA: 8.05 | |||