Dimitris Zoros: student profile
msc, #200811
| Enrolled in: | October 2008 |
|---|---|
| Graduated on: | Tuesday, 27 May 2014 |
| Chosen specializations: |
Thesis
Title: Obstructions and Algorithms for Graph Searching Problems.
Defended: Tuesday, 04 Feb 2014.
Course participations
Exam results
| Exam | Course | Mark |
|---|---|---|
| March 5, 2013 | Λ12Β. Advanced topics in graph theory (2012-2013, fall semester) | 10.0 |
Final grades
| Course | Mark | Credits | |
|---|---|---|---|
| Λ1. | mathematical logic | 7.0 | 4 |
| Λ2. | computability | 10.0 | 4 |
| Λ3. | algorithms and complexity I | 8.0 | 4 |
| Λ4. | algorithms and complexity II | 7.0 | 4 |
| Λ5. | research methodology | 10.0 | 2 |
| Μ6. | set theory | 7.0 | 4 |
| Π6. | basic course in theoretical computer science | 7.5 | 4 |
| M12. | model theory | 9.0 | 4 |
| Λ14. | introduction to λ-calculus | 9.0 | 4 |
| Λ15. | proof theory | 10.0 | 4 |
| Π17. | mathematics and cryptography | 10.0 | 4 |
| Λ97Α. | probabilistic algorithms | 8.0 | 4 |
| Λ07Ν. | parameterized complexity and algorithms | 10.0 | 4 |
| Π01Α. | online algorithms | 10.0 | 4 |
| Π03Β. | semantics of programming languages | 8.0 | 4 |
| Π03Γ. | type systems for programming languages | 9.0 | 4 |
| Π03Ξ. | approximation algorithms | 9.0 | 4 |
| Π05Β. | computation models and complexity | 10.0 | 4 |
| Λ05Δ. | Graph Theory | 9.0 | 4 |
| Λ10Ν. | recurscion and complexity | 10.0 | 2 |
| Λ12Β. | advanced topics in graph theory | 10.0 | 2 |
| ΜΝ11. | advanced topics in parametric complexity | 10.0 | 2 |
| ΛΔΕ. | MSc thesis | 10.0 | 10 |
| GPA: 9.00 | |||
assistant in courses
- Λ2. Computability (2016-2017, fall semester)
- Λ2. Computability (2015-2016, fall semester)
- Λ05Δ. Graph Theory (2014-2015, spring semester)
3 courses.