Talks

  • The complexity of deciding characteristic formulae, The 14th Panhellenic Logic Symposium (PLS 2024).

  • On the power of counting the total number of computation paths of NPTMs, The 18th Annual Conference on Theory and Applications of Models of Computation (TAMC 2024).

  • The complexity of deciding characteristic formulae in van Glabbeek’s branching time spectrum, Third International Workshop on Recent Advances in Concurrency and Logic (RADICAL 2023).

  • Counting computations with formulae: Logical characterisations of counting complexity classes, The 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023).

  • A logical characterization of self-reducible counting problems the decision version of which is easy, The New York Colloquium on Algorithms and Complexity (NYCAC 2022).

  • Descriptive complexity of self-reducible counting problems with an easy decision version, The 33rd Nordic Workshop on Programming Theory (NWPT 2022).

  • Descriptive complexity of hard counting problems the decision version of which is easy, The 17th Athens Colloquium on Algorithms and Complexity (ACAC’22).

  • Descriptive complexity for hard counting problems with easy decision versions, Logic Colloquium (LC’22).

  • Structural and descriptive complexity of hard counting problems with easy decision version, Icelandic Center of Excellence in Theoretical Computer Science (ICE-TCS seminar, Reykjavik University).

  • Characterizations and approximability of hard counting classes below #P, The New York Colloquium on Algorithms and Complexity (NYCAC 2021).

  • Characterizations and approximability of hard counting classes below #P, Young Researchers’ Forum of the 23rd International Symposium on Fundamentals of Computation Theory (FCT 2021).

  • Characterizations and approximability of hard counting classes below #P, The 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020).

  • Descriptive complexity of classes of easy-to-decide counting problems, The 20th International Workshop on Logic and Computational Complexity (LCC’19).