Get started
Author

Aggeliki Chalki

Observed name: Chalki, Aggeliki
ORCID: 0000-0001-5378-0467
Observed ORCID: 0000-0001-5378-0467
OpenAlex ID: A5000573402
A quick guided tour to the modal logic S4.2
2018 · Aggeliki Chalki, Costas D Koutras, et al. · Logic Journal of IGPL · 11
Completeness, approximability and exponential time results for counting problems with easy decision version
2022 · Antonis Antonopoulos, Eleni Bakali, et al. · Theoretical Computer Science · 10
On the Power of Counting the Total Number of Computation Paths of NPTMs
2024 · Eleni Bakali, Aggeliki Chalki, et al. · Lecture notes in computer science · 6
PDF
Characterizations and Approximability of Hard Counting Classes Below $$\#\mathsf {P}$$
2020 · Eleni Bakali, Aggeliki Chalki, et al. · Lecture notes in computer science · 6
PDF
Completeness Results for Counting Problems with Easy Decision
2017 · Eleni Bakali, Aggeliki Chalki, et al. · Lecture notes in computer science · 5
Deciding characteristic formulae: A journey in the branching-time spectrum
2025 · Aceto, Luca, Achilleos, Antonis, et al. · arXiv (Cornell University) · 2
PDF
Guest column: A panorama of counting problems the decision version of which is in P
2022 · Eleni Bakali, Aggeliki Chalki, et al. · ACM SIGACT News · 2
A note on the complexity of S4.2
2021 · Aggeliki Chalki, Costas D. Koutras, et al. · Journal of Applied Non-Classical Logics · 1
The Complexity of Deciding Characteristic Formulae Modulo Nested Simulation (extended abstract)
2025 · Luca Aceto, Antonis Achilleos, et al. · Electronic Proceedings in Theoretical Computer Science
PDF
Works count: 12
Citation count: 46
H-index: 5
I10-index: 2
Year
Topic
Type