Stathis Zachos

Publication Activity (10 Years)

Years Active: 1982-2024
Publications (10 Years): 5

Top Topics

Computational Effort

Top Venues

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)
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, Petros Pantavos, Stathis Zachos
Completeness Results for Counting Problems with Easy Decision. CIAC (2017)
Nikolaos S. Papaspyrou, Stathis Zachos
Teaching Programming through Problem Solving: The Role of the Programming Language. FedCSIS (2013)
Wen-Ju Cheng, Jim Cox, Stathis Zachos
Random Walks on Some Basic Classes of Digraphs. ICTAC (2013)
Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos
Ordered coloring of grids and related graphs. Theor. Comput. Sci. 444 (2012)
Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos
Ordered Coloring Grids and Related Graphs. SIROCCO (2009)
Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos
Maximizing the guarded boundary of an Art Gallery is APX-complete. Comput. Geom. 38 (3) (2007)
Aris Pagourtzis, Katerina Potika, Stathis Zachos
Path multicoloring with fewer colors in spiders and caterpillars. Computing 80 (3) (2007)
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
Randomized and Approximation Algorithms for Blue-Red Matching. MFCS (2007)
Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost. Comput. Networks 50 (1) (2006)
Aris Pagourtzis, Stathis Zachos
The Complexity of Counting Functions with Easy Decision Version. MFCS (2006)
Stratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree. Panhellenic Conference on Informatics (2005)
Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos
How to Place Efficiently Guards and Paintings in an Art Gallery. Panhellenic Conference on Informatics (2005)
Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos
Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. NETWORKING (2004)
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
Satisfying a maximum number of pre-routed requests in all-optical rings. Comput. Networks 42 (1) (2003)
Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete. CIAC (2003)
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
Minimizing Request Blocking in All-Optical Rings. INFOCOM (2003)
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
Routing and path multicoloring. Inf. Process. Lett. 80 (5) (2001)
Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos
Acceptor-Definable Counting Classes. Panhellenic Conference on Informatics (2001)
Costas D. Koutras, Stathis Zachos
Many-Valued Reflexive Autoepistemic Logic. Log. J. IGPL 8 (1) (2000)
Costas D. Koutras, George Koletsos, Stathis Zachos
Many-Valued Modal Non-Monotonic Reasoning: Sequential Stable Sets and Logics with Linear Truth Spaces. Fundam. Informaticae 38 (3) (1999)
Martin Fürer, Oded Goldreich, Yishay Mansour, Michael Sipser, Stathis Zachos
On Completeness and Soundness in Interactive Proof Systems. Adv. Comput. Res. 5 (1989)
Stathis Zachos
Probabilistic Quantifiers and Games. J. Comput. Syst. Sci. 36 (3) (1988)
Ravi B. Boppana, Johan Håstad, Stathis Zachos
Does co-NP Have Short Interactive Proofs? Inf. Process. Lett. 25 (2) (1987)
Stathis Zachos, Martin Fürer
Probabalistic Quantifiers vs. Distrustful Adversaries. FSTTCS (1987)
Stathis Zachos, Hans Heller
A Decisive Characterization of BPP Inf. Control. 69 (1-3) (1986)
Stathis Zachos
Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview. Computational Complexity Conference (1986)
Stathis Zachos
A New Characterization of BPP. FSTTCS (1984)
Christos H. Papadimitriou, Stathis Zachos
Two remarks on the power of counting. Theoretical Computer Science (1983)
Stathis Zachos
Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations Inf. Control. 54 (3) (1982)