| A quick guided tour to the modal logic S4.2 A Chalki, CD Koutras, Y Zikos Logic Journal of the IGPL 26 (4), 429-451, 2018 | 16 | 2018 |
| Completeness, approximability and exponential time results for counting problems with easy decision version A Antonopoulos, E Bakali, A Chalki, A Pagourtzis, P Pantavos, S Zachos Theoretical Computer Science 915, 55-73, 2022 | 9 | 2022 |
| Completeness results for counting problems with easy decision E Bakali, A Chalki, A Pagourtzis, P Pantavos, S Zachos International Conference on Algorithms and Complexity, 55-66, 2017 | 9 | 2017 |
| Characterizations and Approximability of Hard Counting Classes Below E Bakali, A Chalki, A Pagourtzis International Conference on Theory and Applications of Models of Computation …, 2020 | 8 | 2020 |
| A note on the complexity of S4. 2 A Chalki, CD Koutras, Y Zikos Journal of Applied Non-Classical Logics 31 (2), 108-129, 2021 | 3 | 2021 |
| On the power of counting the total number of computation paths of NPTMs E Bakali, A Chalki, S Kanellopoulos, A Pagourtzis, S Zachos Annual Conference on Theory and Applications of Models of Computation, 209-220, 2024 | 2 | 2024 |
| Counting computations with formulae: logical characterisations of counting complexity classes A Achilleos, A Chalki arXiv preprint arXiv:2304.10334, 2023 | 1 | 2023 |
| Guest column: A panorama of counting problems the decision version of which is in P3 E Bakali, A Chalki, A Göbel, A Pagourtzis, S Zachos ACM SIGACT News 53 (3), 46-68, 2022 | 1 | 2022 |
| The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum L Aceto, A Achilleos, A Chalki, A Ingolfsdottir arXiv preprint arXiv:2405.13697, 2024 | | 2024 |
| The complexity of deciding characteristic formulae L Aceto, A Achilleos, A Chalki, A Ingólfsdóttir | | |
| Descriptive complexity of self-reducible counting problems with an easy decision version A Achilleos, A Chalki | | |
Aris PagourtzisNational Technical University of Athens在 cs.ntua.gr 的電子郵件地址已通過驗證