default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAggeliki Chalki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]Eleni Bakali, Aggeliki Chalki
, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos:
On the Power of Counting the Total Number of Computation Paths of NPTMs. TAMC 2024: 209-220- [i4]Luca Aceto, Antonis Achilleos, Aggeliki Chalki, Anna Ingólfsdóttir:
The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum. CoRR abs/2405.13697 (2024) - 2023
- [c3]Antonis Achilleos, Aggeliki Chalki:
Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes. MFCS 2023: 7:1-7:15 - [i3]Antonis Achilleos, Aggeliki Chalki:
Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes. CoRR abs/2304.10334 (2023) - [i2]Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos:
On the power of counting the total number of computation paths of NPTMs. CoRR abs/2306.11614 (2023) - 2022
- [b1]Aggeliki Chalki:
On structural and descriptive complexity of hard counting problems the decision version of which is easy. National Technical University of Athens, Greece, 2022 - [j4]Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos:
Guest column: A panorama of counting problems the decision version of which is in P3. SIGACT News 53(3): 46-68 (2022) - [j3]Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos:
Completeness, approximability and exponential time results for counting problems with easy decision version. Theor. Comput. Sci. 915: 55-73 (2022) - 2021
- [j2]Aggeliki Chalki, Costas D. Koutras, Yorgos Zikos:
A note on the complexity of S4.2. J. Appl. Non Class. Logics 31(2): 108-129 (2021) - 2020
- [c2]Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis:
Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\). TAMC 2020: 251-262 - [i1]Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis:
Characterizations and approximability of hard counting classes below #P. CoRR abs/2003.02524 (2020)
2010 – 2019
- 2018
- [j1]Aggeliki Chalki, Costas D. Koutras, Yorgos Zikos:
A quick guided tour to the modal logic S4.2. Log. J. IGPL 26(4): 429-451 (2018) - 2017
- [c1]Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos:
Completeness Results for Counting Problems with Easy Decision. CIAC 2017: 55-66
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
