Eleni Bakali

According to our database, Eleni Bakali authored at least 13 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2023

On the power of counting the total number of computation paths of NPTMs.

Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos

CoRR, 2023

2022

Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users.

Merkouris Karaliopoulos, Eleni Bakali

IEEE Trans. Mob. Comput., 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

Guest column: A panorama of counting problems the decision version of which is in P³.

Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos

SIGACT News, 2022

2020

Characterizations and approximability of hard counting classes below #P.

Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis

CoRR, 2020

Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\).

Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis

Proceedings of the Theory and Applications of Models of Computation, 2020

2018

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

Eleni Bakali

PhD thesis, 2018

Exact uniform sampling over catalan structures.

Alexandros Angelopoulos, Eleni Bakali

CoRR, 2018

On randomized counting versus randomised decision.

Eleni Bakali

CoRR, 2018

2017

Relating counting complexity to non-uniform probability measures.

Eleni Bakali

CoRR, 2017

Completeness Results for Counting Problems with Easy Decision.

Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Stathis Zachos at 70!

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

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

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