Eleni Bakali

According to our database1, Eleni Bakali authored at least 13 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Power of Counting the Total Number of Computation Paths of NPTMs.
Proceedings of the Theory and Applications of Models of Computation, 2024

2022
Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users.
IEEE Trans. Mob. Comput., 2022

Completeness, approximability and exponential time results for counting problems with easy decision version.
Theor. Comput. Sci., 2022

Guest column: A panorama of counting problems the decision version of which is in P<sup>3</sup>.
SIGACT News, 2022

2020
Characterizations and approximability of hard counting classes below #P.
CoRR, 2020

Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\).
Proceedings of the Theory and Applications of Models of Computation, 2020

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

Exact uniform sampling over catalan structures.
CoRR, 2018

On randomized counting versus randomised decision.
CoRR, 2018

2017
Relating counting complexity to non-uniform probability measures.
CoRR, 2017

Completeness Results for Counting Problems with Easy Decision.
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.
CoRR, 2016


  Loading...