I am a research fellow in Computer Science at the School of Computing of the National University of Singapore, hosted by Arnab Bhattacharyya. My research interests are computational complexity theory and computational learning theory.
Previously, I earned a PhD in Computing from the Department of Computing of Imperial College London, whereby I was advised by Mahdi Cheraghchi. I hold an MSc in Logic, Algorithms and Computation from the Department of Mathematics of the University of Athens, whereby I worked with Stathis Zachos and Iordanis Kerenidis on quantum computational complexity theory, and a joint BEng-MEng diploma from the School of Mechanical Engineering of the National Technical University of Athens, whereby I worked with Evangelos Papadopoulos on four-legged robots.
[CV] [DBLP] [Google Scholar] [Mathematics Genealogy Project] [LinkedIn] [LeetCode]
Address:
NUS School of Computing, COM1,
13 Computing Dr, Singapore 117417
Email:
dimyrisiotis [AT] gmail [DOT] com
Total variation distance estimation is as
easy as probabilistic inference
Joint with
Arnab Bhattacharyya,
Sutanu Gayen,
Kuldeep S. Meel,
A. Pavan,
and
N. V. Vinodchandran.
Preprint (2023)
[ECCC]
[arXiv]
On approximating total variation distance
Joint with
Arnab Bhattacharyya,
Sutanu Gayen,
Kuldeep S. Meel,
A. Pavan,
and
N. V. Vinodchandran.
IJCAI 2023
[arXiv]
[Conference version]
One-way functions and a conditional variant of MKTP
Joint with
Eric Allender,
Mahdi Cheraghchi,
Harsha Tirumala,
and
Ilya Volkovich.
FSTTCS 2021
[ECCC]
[Conference version]
[Harsha's talk @ FSTTCS 2021]
[Talk @ DIMACS (2022)]
One-tape Turing machine and branching program lower
bounds for MCSP
Joint with
Mahdi Cheraghchi,
Shuichi Hirahara,
and
Yuichi Yoshida.
STACS 2021
Invited to the special issue of Theory of Computing Systems (2022)
[ECCC]
[Conference version]
[Talk @ STACS 2021]
Algorithms and lower bounds for De Morgan formulas
of low-communication leaf gates
Joint with
Valentine Kabanets,
Sajin Koroth,
Zhenjian Lu,
and
Igor C. Oliveira.
CCC 2020
ACM Transactions on Computation Theory (2021)
[ECCC]
[arXiv]
[Conference version]
[Journal version]
[Talk @ CCC 2020]
Circuit lower bounds for MCSP from local pseudorandom
generators
Joint with
Mahdi Cheraghchi,
Valentine Kabanets,
and
Zhenjian Lu.
ICALP 2019
ACM Transactions on Computation Theory (2020)
[ECCC]
[Conference version]
[Journal version]
On the effects of design parameters on quadruped robot gaits
Joint with Ioannis Poulakakis and Evangelos
Papadopoulos.
ROBIO 2015
[Conference version PDF]
Quadruped optimum gaits analysis for planetary exploration
Joint with Ioannis Kontolatis,
Iosif Paraskevas,
Evangelos
Papadopoulos,
Guido de Croon,
and
Dario Izzo.
ASTRA 2013
[Conference version PDF]
The complexity and applications of circuit minimization
PhD thesis, Department of Computing, Imperial College London, 2021
[Official version]
Quantum complexity, relativized worlds, and oracle separations
MSc thesis, Department of Mathematics, University of Athens, 2016
[Official version]
Parametric study of the gaits of a quadruped
robot using Hildebrand diagrams
Joint BEng-MEng diploma thesis, School of Mechanical Engineering,
National Technical University of Athens, 2013 (in Greek)
[Official version]