Scholar

Dimitrios Myrisiotis

Google Scholar ID: BvR0TM8AAAAJ

Research Fellow at CNRS@CREATE LTD.

Foundations of Machine LearningComputational Complexity Theory

Citations & Impact

All-time

Citations

135

H-index

i10-index

Publications

Co-authors

list available

Contact

Publications

1 items

2025

Cited

Resume (English only)

Academic Achievements

Paper 'Total variation distance for product distributions is #P-complete' published in Information Processing Letters (2025).
Paper 'Computational explorations of total variation distance' accepted as a Spotlight (Top 5.1%) at ICLR 2025.
Paper 'Learnability of parameter-bounded Bayes nets' presented as a poster at SPIGM @ ICML 2024 and accepted at AAAI 2025.
Paper 'Total variation distance meets probabilistic inference' published at ICML 2024.
Paper 'On approximating total variation distance' published at IJCAI 2023.
Paper 'One-way functions and a conditional variant of MKTP' published at FSTTCS 2021.
Paper 'One-tape Turing machine and branching program lower bounds for MCSP' published at STACS 2021 and invited to a special issue of Theory of Computing Systems (2022).
Paper 'Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates' published at CCC 2020 and in ACM Transactions on Computation Theory (2021).
Paper 'Circuit lower bounds for MCSP from local pseudorandom generators' published at ICALP 2019.

Co-authors

23 total