Eleni Bakali

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 13

Top Topics

Probability Measures

Computational Effort

Top Venues

IEEE Trans. Mob. Comput.

Publications

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)
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
On the power of counting the total number of computation paths of NPTMs. CoRR (2023)
Merkouris Karaliopoulos, Eleni Bakali
Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users. IEEE Trans. Mob. Comput. 21 (4) (2022)
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 (2022)
Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos
. SIGACT News 53 (3) (2022)
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
Characterizations and approximability of hard counting classes below #P. CoRR (2020)
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\). TAMC (2020)
Eleni Bakali
On randomized counting versus randomised decision. CoRR (2018)
Alexandros Angelopoulos, Eleni Bakali
Exact uniform sampling over catalan structures. CoRR (2018)
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
Completeness Results for Counting Problems with Easy Decision. CIAC (2017)
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
Stathis Zachos at 70! CIAC (2017)
Eleni Bakali
Relating counting complexity to non-uniform probability measures. CoRR (2017)
Eleni Bakali
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)