Sotiris holds an MEng in Electrical and Computer Engineering from the National Technical University of Athens (NTUA). His thesis was about applications of logic in the field of computational complexity, specifically the descriptive complexity of counting problems.

He is currently a PhD student in the School of Electrical and Computer Engineering of NTUA on the subject of “Computational Complexity of Counting Problems”.

He has received multiple awards in mathematics competitions, including three medals in National Mathematical Olympiads “Archimedes”. He has also been awarded twice in the Panhellenic Physics Competition and once in the Panhellenic Chemistry Competition.

RESEARCH INTERESTS

Sotiris’ research interests include logic, algorithms, complexity and other related fields such as game theory. Specifically, his research will focus on the areas of computational complexity of counting problems and descriptive complexity.

PhD research on "Approximation Schemes for Subset Sum and Partitioning problems"
Abstract: We develop fully polynomial-time approximation schemes (FPTAS) for k-Subset Sum Ratio, i.e., the problem of finding k disjoint subsets of n positive intergers, such that the sums of the subsets are as close as possible to each other. We also extend an FPTAS to k-way Number Partitioning, a practical problem related to fair division.