Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds. - Eleni Bakali (CoRR, 2016)

Stathis Zachos at 70! - Eleni Bakali; Panagiotis Cheilaris; Dimitris Fotakis 001; Martin Fürer; Costas D. Koutras; Euripides Markou; Christos Nomikos; Aris Pagourtzis; Christos H. Papadimitriou; Nikolaos S. Papaspyrou; Katerina Potika (CIAC, 2017)

Completeness Results for Counting Problems with Easy Decision. - Eleni Bakali; Aggeliki Chalki; Aris Pagourtzis; Petros Pantavos; Stathis Zachos (CIAC, 2017)

Relating counting complexity to non-uniform probability measures. - Eleni Bakali (CoRR, 2017)

On randomized counting versus randomised decision. - Eleni Bakali (CoRR, 2018)

Exact uniform sampling over catalan structures. - Alexandros Angelopoulos; Eleni Bakali (CoRR, 2018)

Ιδιότητες συναρτήσεων μέτρησης πλήθους λύσεων σε προβλήματα με εύκολη απόφαση ύπαρξης λύσης: πληρότητα, προσεγγισιμότητα, μαρκοβιανές αλυσίδες, αλλαγές φάσης - Eleni Bakali (2018)

Characterizations and Approximability of Hard Counting Classes Below ( # mathsf {P} ). - Eleni Bakali; Aggeliki Chalki; Aris Pagourtzis (TAMC, 2020)

Characterizations and approximability of hard counting classes below #P. - Eleni Bakali; Aggeliki Chalki; Aris Pagourtzis (CoRR, 2020)

Guest column: A panorama of counting problems the decision version of which is in P3. - Eleni Bakali; Aggeliki Chalki; Andreas Göbel 001; Aris Pagourtzis; Stathis Zachos (SIGACT News, 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., 2022)

Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users. - Merkouris Karaliopoulos; Eleni Bakali (IEEE Trans. Mob. Comput., 2022)

On the Power of Counting the Total Number of Computation Paths of NPTMs. - Eleni Bakali; Aggeliki Chalki; Sotiris Kanellopoulos; Aris Pagourtzis; Stathis Zachos (TAMC, 2024)