Aggeliki Chalki

dblp:199/5902 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
4since 2021 · last 2025
0000-0001-5378-0467ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 4 since 2021
YearPublicationVenuePosition
2025 The Complexity of Deciding Characteristic Formulae in Van Glabbeek's Branching-Time Spectrum
Luca Aceto, Antonis Achilleos, Aggeliki Chalki, Anna Ingólfsdóttir
CSL3
2024 On the Power of Counting the Total Number of Computation Paths of NPTMs
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
TAMC2
2023 Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes
Antonis Achilleos, Aggeliki Chalki
MFCS2
2022 Completeness, approximability and exponential time results for counting problems with easy decision version
Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
Theor. Comput. Sci.3
2020 Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\)
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
TAMC2
2017 Completeness Results for Counting Problems with Easy Decision
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
CIAC2