Résumé
Education

Diploma in Applied Mathematics
School of Applied Mathematics and Physical Sciences, National Technical University of Athens GPA: 9,1/10 "Summa cum laude"
 Majors: "Applied Analysis" and "Mathematics of Computer Science"
 Diploma Thesis: “Derandomization under Uniform Assumptions”, Advisor: Stathis Zachos
Research Interests
I am mainly interested in the area of Computational Complexity, especially in Pseudorandomnness and Derandomization, and in connected subfields such as Counting Complexity, Decision Trees, PCPs and MeasureTheoretic Notions in Complexity Classes (ResourceBounded Measure). I'm also interested in (sorted in decreasing order of interest): Theory of Computation (especially in Recursion Theory)
 Theory of Algorithms
 Quantum Computation
 Mathematical Logic and Foundations of Mathematics
Teaching Assistance
 Theoretical Computer Science I: Algorithms & Complexity II (Computational Complexity), Graduate Course, 20112012, 20122013
 Theoretical Computer Science II: Structural Complexity, Graduate Course, 20112012 (TA and Syllabus proposal)
 Introduction to Computer Programming, Lab Support, 20112012, 20122013
 Automata & Formal Grammars, 20122013
 Computability & ComplexityModels of Computation, 20122013
Language Skills
 English: Fluent (Michigan Certificate of Proficiency in English)
 French: Fluent (Sorbonne II (C2), Université de Sorbonne)
 Italian: Basic
Computer Skills
 Operating Systems: Microsoft Windows family, Linux, Linux/UNIX System Administration
 Programming: Java, Perl, BASH Shell Scripting, Visual Basic.NET, Matlab, Mathematica
 Web Programming: PHP, Javascript & A.J.A.X.
 Information/Internet Technology: Networking (TCP/IP, Network Security & Administration), Services (Apache, MySQL, Bind), Drupal
 Applications: TeX (LaTeX, BibTeX), Microsoft Office, Libre Office and other common platforms.
 Music Software: Steinberg's Cubase, Nuendo, MakeMusic's Finale, MIDI Programming
Work Experience
 Gloman SA: Server administration and scripting
Music Education
 Modern Organ (Jazz) Diploma "Grade 5", Yamaha Music Foundation, Professor: Costas Christodoulou
 Classical Piano, Philippos Nakas Conservatory, Professor: Alexandra Papastefanou
 Harmony Degree, Philippos Nakas Conservatory, Professor: Joseph Papadatos, Grade: 9.81/10
 Counterpoint Degree, Philippos Nakas Conservatory, Professor: Joseph Papadatos, Grade: 9.77/10
 Fugue Degree, Philippos Nakas Conservatory, Professor: Costas Varotsis, Grade: 9.83/10
 Composition, Philippos Nakas Conservatory, Professor: Costas Varotsis, 1^{st} year of study
Talk Slides
 "The Polynomial Hierarchy" (pdf)
Presented during "Theoretical Computer Science I: Algorithms & Complexity" CoReLab's grad course (20092010 and 20102011).

"Equilibria, Fixed Points, and Complexity Classes" (pdf)
Based on a survey paper by Mihalis Yannakakis, Computer Science Review 3(2): 7185 (2009) (DOI).
Presented in CoReLab Seminar (abstract  popup).
 "The map of NP" (pdf)
Presented during "Theoretical Computer Science I: Algorithms & Complexity" CoReLab's grad course (20102011).
 "PLSCompleteness of computing a Pure Nash Equilibrium" (pdf)
Presented during "Theoretical Computer Science II: Algorithmic Game Theory" CoReLab's grad course (20102011).
 "The Relative Complexity of Approximate Counting Problems" (pdf)
Based on the paper by Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill and Mark Jerrum, Algorithmica 38(3): 471500, 2003 (Link).
Presented during "Network Algorithms & Complexity" CoReLab's grad course (20102011).
 "Derandomization under Uniform Assumptions"
Part 1 (pdf), Part 2 (pdf)
Diploma Thesis Defense Slides, including (among others):
Part 1: Brief Introduction to the field, Boolean Circuits & Lower Bounds, Pseudorandom Generators, Derandomization using Pseudorandom Generators, Introduction to Uniform Derandomization.
Part 2: Unirorm Derandomization of BPP, RP and AM (Results of Impagliazzo, Wigderson, 1998, Kabanets, 2000, Lu, 2000, Gutfreud, Shaltiel, TaShma, 2003 and Shaltiel, Umans, 2009), Derandomization versus Circuit Lower Bounds, TypicallyCorrect Derandomization, Other Notions and Consequences, Applications to the (Hausdorff) Dimension of Complexity Classes, etc.
Also presented as a series of lectures in CoReLab seminar:
(abstract 1  popup, abstract 2  popup, abstract 3  popup)
 "Randomized Computation" (pdf)
Presented during "Theoretical Computer Science I: Algorithms & Complexity" CoReLab's grad course (20112012).
 "NonUniform Complexity" (pdf)
Presented during "Theoretical Computer Science I: Algorithms & Complexity" CoReLab's grad course (20112012).
 "Interactive Proof Systems: IPs, AMs & PCPs" (pdf)
Presented during "Theoretical Computer Science II: Structural Complexity" CoReLab's grad course (20112012).
 "Expander Graphs and their applications" (pdf)
Based on "Shlomo Hoory, Nathan Linial, and Avi Wigderson, "Expander graphs and their applications", Bulletin of American Mathematical Society, 43:439–561, 2006." (AMS Link)
Presented during "Theoretical Computer Science II: Structural Complexity" CoReLab's grad course (20112012).
 "Quantifier Characterizations of Complexity Classes" (pdf)
Presented during "Theoretical Computer Science I: Algorithms & Complexity" CoReLab's grad course (20122013).
 "WellQuasiOrdering and Induced Subgraphs" (pdf)
Presented during "Just Treewidth in Athens" (JTA '13) miniworkshop, organized by prof. D. M. Thilikos.
Theses
 "Derandomization under Uniform Assumptions", Diploma Thesis (pdf)
 BibTeX References List (html)
Others
 "Quantifier Characterization of Complexity Classes" (pdf)
 "Operators on Complexity Classes" (pdf)
 Computational Complexity in LaTeX:
A set of TeX commands useful in writing Complexity in LaTeX (e.g. more easy to write "\NP \cs \EXP" than "\mathbf{NP} \subseteq \mathbf{EXP}" or "\Stwo \cs \PSPACE" than "\Sigma_{2}^{p} \subseteq \mathbf{PSPACE}").
There is also a cheatsheet useful for the commands, and also as a first glossary for Complexity Classes: Complexity Classes and Complexity in LaTeX cheatsheet (pdf)
 LaTeX Preamble (tex)
Complexity around the World (Wide Web)
Remarkable papers concerning the value and the importance of Computational Complexity:
 Complexity TheoryA Survey (Oded Goldreich and Avi Wigderson)
 The Gődel Phenomena in Mathematics: A Modern View (A. Wigderson)
 Knowledge, Creativity and P versus NP (A. Wigderson)
 P, NP and Mathematics  A computational complexity perspective (A. Wigderson)
Complexity Blogs
 In Theory (Luca Trevisan)
 Gödel’s Lost Letter and P=NP (Richard Lipton)
 Computational Complexity (Lance Fortnow & Bill Gasarch)
 ShtetlOptimized (Scott Aaronson)
 Oded Goldreich's Homepage
 Scott Aaronson's Homepage
Electronic Journals
 Electronic Colloquium on Computational Complexity (ECCC)
 ACM's Special Interest Group on Algorithms and Computation Theory (SIGACT)
Complexity Courses
 PCP and Hardness of Approximation, Berkeley, Spring 2006 (Luca Trevisan)
 Computational Complexity, Berkeley, Spring 2008 (Luca Trevisan)
 Computational Complexity, Princeton, Spring 2007 (Boaz Barak)
 Computational Complexity, Princeton, Spring 2001 (Sanjeev Arora)
 Computational Complexity, Princeton, Spring 2003 (Sanjeev Arora)
 Advanced Complexity Theory, MIT, Spring 2007 (Madhu Sudan)
 Complexity of Computation, Rutgers University, Spring 2007 (Eric Allender)
 Introduction to Computational Complexity, Brown University, Spring 2007 (John E. Savage)
 Quantum Complexity Theory, MIT, Fall 2010 (Scott Aaronson)
 Advanced Complexity Theory, MIT, Spring 2005 (Madhu Sudan)
 Advanced Complexity Theory, MIT, Fall 2001 (Dan Spielman)
 Theory of Computation, MIT, Fall 2006 (Michael Sipser)
 Computational Complexity, TIFR, 201112 (Prahladh Harsha)
 Computational Complexity, Stanford University, Spring 2010 (Luca Trevisan)
 Computational Complexity, Tel Aviv University (Muli Safra)
 Computational Complexity, University of Illinois, Spring 2009 (Manoj M. Prabhakaran)
 Boolean Circuit Complexity, Tel Aviv University, Fall 19941995 (Uri Zwick)
 Pseudorandomness and combinatorial constructions, CalTech (Chris Umans)
 Pseudorandomness and Combinatorial Constructions, University of Texas, Spring 2001 (David Zuckerman)
 Pseudorandomness and Combinatorial Constructions, UC Berkeley, Fall 2005 (Luca Trevisan)
 Pseudorandomness, Fall 2004 (Valentine Kabanets)
 Expander graphs and their applications, IAS Princeton (Nati Linial and Avi Wigderson)
Other Links
 ResourceBounded Measure Bibliography (Maintained by John Hitchcock)
 Effective Fractal Dimension Bibliography (Maintained by John Hitchcock)
Last updated: 12/10/2013