ПОМИ РАН, СПбАУ РАН
Кандидат физико-математических наук, старший научный сотрудник лаборатории математической логики ПОМИ РАН, преподаватель в Академическом университете.
Личная страница: http://logic.pdmi.ras.ru/~dmitrits/
Научные интересы: сложность вычислений, математическая логика, криптография, сложность доказательств.
| Course | Semester |
|---|---|
| Computational Complexity Theory | autumn 2021 |
| Introduction to Theoretical Computer Science | autumn 2020 |
| Propositional proof complexity | autumn 2017 |
| Introduction to Theoretical Computer Science | autumn 2016 |
| Theoretical foundations of cryptography | spring 2016 |
| Probabilistic methods in computations | spring 2015 |
| Foundations of computability and complexity theory | autumn 2014 |
| Introduction to Theoretical Computer Science | autumn 2013 |
| The computational complexity and foundations of cryptography | spring 2013 |
| Foundations of computability and complexity theory | autumn 2012 |
| Probabilistically checkable proofs | autumn 2012 |
| Probabilistic methods in computations | spring 2012 |
| Computability and logic | autumn 2011 |
| Mathematical Foundations of Computer Science | autumn 2009 |
| Hardness vs Randomness | spring 2009 |
| Introduction to Theoretical Computer Science | autumn 2008 |
| Introduction to Theoretical Computer Science | autumn 2007 |
