Dimitrios Tsintsilidas

PhD Student · Theoretical Computer Science · University of Warwick

About

Hi, my name is Dimitrios Tsintsilidas!

I am a third-year PhD student at the Computer Science Department of the University of Warwick, member of the Theory and Foundations 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.

Dimitrios Tsintsilidas

Publications

Provability of the Circuit Size Hierarchy and Its Consequences
joint work with Marco Carmosino, Valentine Kabanets, Antonina Kolokolova and Igor C. Oliveira
PDF Abstract

Preprints

Field-independent Kronecker-plethysm isomorphisms
joint work with Christian Ikenmeyer and Heidi Omar
arXiv Abstract

Thesis

Certifiable Random Number Generation Using Nonlocal Games
Diploma Thesis, supervised by Alex Bredariol Grilo
PDF
Sheaves on Topological Spaces, Sites and Group Categories
Master's Thesis, supervised by Chrysostomos Psaroudakis
PDF

Notes

Methods of Witnessing in Bounded Arithmetic
Draft notes (may have some mistakes)
PDF
Fundamental Group and Universal Covering of Lie Groups
Project on "Differential Manifolds" course
PDF

Talks and Presentations

Provability of the Circuit Size Hierarchy

Proof Complexity Workshop
University of Oxford, 3-5 September 2024
British Logic Colloquium
University of Birmingham, 5-7 September 2024
Innovations in Theoretical Computer Science (ITCS) 2025
Columbia University, 7-10 January 2025
Video

Nonlocal Games and Verification of Quantum Computation

Quantum Computing Guest Lecture
University of Warwick, 11 March 2025

Metacomplexity Reading Group

University of Warwick, Term 1, 2024-25
NP-hardness of MINKT* (based on Hir22)
Notes
Meta-mathematics of proof complexity (based on KP89 and Oli24)

Metamathematics of Computational Complexity Theory

Warwick Postgraduate Colloquium in Computer Science (WPCCS) 2024
University of Warwick, 19 March 2025

Teaching

University of Warwick - Teaching Assistant

CS419 - Quantum Computing
2023/24 Academic Year
CS356 - Approximation and Randomised Algorithms
2023/24 Academic Year
MA3E1 - Groups and Representations
2023/24 Academic Year
CS260 - Algorithms
2023/24 Academic Year