Eleni Bakali

14 papers C 4Journal 9
YearRankTypeTitle / Venue / Authors
2024 C conf
On the Power of Counting the Total Number of Computation Paths of NPTMs.
TAMC
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
2023 J jnl
On the power of counting the total number of computation paths of NPTMs.
CoRR
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
2022 J jnl
Completeness, approximability and exponential time results for counting problems with easy decision version.
Theor. Comput. Sci.
Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
2022 J jnl
Guest column: A panorama of counting problems the decision version of which is in P
SIGACT News
Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos
2022 J jnl
Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users.
IEEE Trans. Mob. Comput.
Merkouris Karaliopoulos, Eleni Bakali
2020 C conf
Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\).
TAMC
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
2020 J jnl
Characterizations and approximability of hard counting classes below #P.
CoRR
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
2018 J jnl
Exact uniform sampling over catalan structures.
CoRR
Alexandros Angelopoulos, Eleni Bakali
2018 J jnl
On randomized counting versus randomised decision.
CoRR
Eleni Bakali
2018 — —
Ιδιότητες συναρτήσεων μέτρησης πλήθους λύσεων σε προβλήματα με εύκολη απόφαση ύπαρξης λύσης: πληρότητα, προσεγγισιμότητα, μαρκοβιανές αλυσίδες, αλλαγές φάσης
Eleni Bakali
2017 C conf
Completeness Results for Counting Problems with Easy Decision.
CIAC
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
2017 J jnl
Relating counting complexity to non-uniform probability measures.
CoRR
Eleni Bakali
2017 C conf
Stathis Zachos at 70!
CIAC
Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Fürer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika
2016 J jnl
Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds.
CoRR
Eleni Bakali