About
Hi, my name is Dimitrios Tsintsilidas!
I am a first-year PhD student at the Computer Science Department of the University of Warwick, member of the Theory and Foundations (FoCS) group and the Centre for Discrete Mathematics and its Applications (DIMAP), advised by Igor Carboni Oliveira and Christian Ikenmeyer. My research is supported by the Chancellors' International Scholarship.
Previously, I studied Pure Mathematics (Algebra & Logic) at Aristotle University of Thessaloniki and completed my Diploma in Electrical & Computer Engineering with a thesis on Quantum Cryptography at LIP6, CNRS/Sorbonne University.
Research Interests
Computational Complexity
Exploring fundamental limits of efficient computation, including the P vs NP problem, circuit complexity, and proof complexity.
Algebraic Methods
Applying abstract algebra to complexity theory, particularly in algebraic complexity and geometric complexity theory.
Proof Complexity
Studying formal proof systems and their computational aspects, including propositional proof systems and bounded arithmetic.
Publications
Thesis
Talks and Presentations
Provability of the Circuit Size Hierarchy
Nonlocal Games and Verification of Quantum Computation
Metamathematics of Computational Complexity Theory
Teaching
University of Warwick - Teaching Assistant
- Led weekly problem-solving sessions
- Graded assignments and exams
- Held office hours for student consultations
- Conducted tutorial sessions on approximation techniques
- Assisted with algorithm design workshops
- Facilitated problem classes on group theory
- Provided feedback on coursework submissions
- Taught fundamental algorithm design techniques
- Conducted complexity analysis workshops