My academic interests lie in Theoretical Computer Science, where mathematics and computation meet.

During my undergraduate studies, I gradually realized that I was less interested in software implementation and increasingly fascinated by the mathematical principles underlying computation. Rather than asking how to implement an algorithm, I became interested in understanding why an algorithm works, whether it can be improved, and what its fundamental computational limitations are.

This perspective naturally led me toward algorithms, computational complexity, distributed computing, and algorithmic game theory. What motivates me most is not simply solving computational problems, but understanding the mathematical structure behind them.

I believe mathematics provides the language through which computer science can be rigorously understood and advanced. For me, research is an opportunity to explore unanswered questions, develop new mathematical ideas, and contribute to a deeper understanding of computation.

My long-term goal is to pursue an academic research career in Theoretical Computer Science, contributing to the development of new algorithms, complexity results, and mathematical models that advance the field.

Department of Computer Science
University of Cyprus

Supervisor: Dr. Mario Mavronicolas

I am currently conducting undergraduate research in Algorithmic Game Theory, studying mathematical models of strategic interaction and learning dynamics.

Current research explores topics including:

• Nash Equilibrium
• Learning in Games
• Evolutionary Game Dynamics
• Replicator Dynamics

A detailed description of the project will be added after the completion of the research.

The questions that motivate my work are fundamentally mathematical rather than purely computational.

Some examples include:

• Can an algorithm be proven to be more efficient?
• What is the intrinsic computational complexity of a problem?
• Which mathematical structures explain algorithmic behaviour?
• How can strategic interaction be analysed through rigorous mathematical models?
• What are the fundamental limits of efficient computation?

I enjoy understanding not only mathematical results themselves, but also the ideas, proofs, and reasoning that make those results possible. These questions motivate both my research interests and the academic projects presented in this profile.

This GitHub profile contains selected academic projects completed throughout my undergraduate studies together with future research projects.

Repositories currently focus on:

• Exact Algorithms for the Hitting Set Problem
• Trie-based Dictionary and Auto-completion System
• Distributed Algorithms
• Programming Languages
• Concurrent Programming
• Constraint Programming
• Database Systems

Each repository aims to provide not only source code, but also documentation explaining the theoretical concepts, design decisions, and algorithmic ideas behind the implementation.

My current priorities include:

• Undergraduate research in Algorithmic Game Theory
• Participation in the International Collegiate Programming Contest (ICPC)
• Bachelor's Thesis
• Graduate studies in Theoretical Computer Science

Ultimately, I hope to contribute to the mathematical foundations of algorithms, computation, and strategic interaction through research.

📧 Email
Coming soon

💼 LinkedIn
Coming soon

🌐 Portfolio
Coming soon

📄 Curriculum Vitae
Coming soon