Stathis Zachos

According to our database, Stathis Zachos authored at least 31 papers between 1982 and 2024.

Collaborative distances:

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

2024

On the Power of Counting the Total Number of Computation Paths of NPTMs.

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

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

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

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

2013

Random Walks on Some Basic Classes of Digraphs.

Wen-Ju Cheng, Jim Cox, Stathis Zachos

Proceedings of the Theoretical Aspects of Computing - ICTAC 2013, 2013

Teaching Programming through Problem Solving: The Role of the Programming Language.

Nikolaos S. Papaspyrou, Stathis Zachos

Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

2012

Ordered coloring of grids and related graphs.

Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos

Theor. Comput. Sci., 2012

2007

Path multicoloring with fewer colors in spiders and caterpillars.

Aris Pagourtzis, Katerina Potika, Stathis Zachos

Computing, 2007

Maximizing the guarded boundary of an Art Gallery is APX-complete.

Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos

Comput. Geom., 2007

Randomized and Approximation Algorithms for Blue-Red Matching.

Christos Nomikos, Aris Pagourtzis, Stathis Zachos

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost.

Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos

Comput. Networks, 2006

The Complexity of Counting Functions with Easy Decision Version.

Aris Pagourtzis, Stathis Zachos

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005

Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree.

Stratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos

Proceedings of the Advances in Informatics, 2005

How to Place Efficiently Guards and Paintings in an Art Gallery.

Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos

Proceedings of the Advances in Informatics, 2005

2004

Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks.

Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos

Proceedings of the NETWORKING 2004, 2004

2003

Satisfying a maximum number of pre-routed requests in all-optical rings.

Christos Nomikos, Aris Pagourtzis, Stathis Zachos

Comput. Networks, 2003

Minimizing Request Blocking in All-Optical Rings.

Christos Nomikos, Aris Pagourtzis, Stathis Zachos

Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

2001

Routing and path multicoloring.

Christos Nomikos, Aris Pagourtzis, Stathis Zachos

Inf. Process. Lett., 2001

Acceptor-Definable Counting Classes.

Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos

Proceedings of the Advances in Informatics, 8th Panhellenic Conference on Informatics, 2001

2000

Many-Valued Reflexive Autoepistemic Logic.

Costas D. Koutras, Stathis Zachos

Log. J. IGPL, 2000

1999

Many-Valued Modal Non-Monotonic Reasoning: Sequential Stable Sets and Logics with Linear Truth Spaces.

Costas D. Koutras, George Koletsos, Stathis Zachos

Fundam. Informaticae, 1999

1998

Tree Models and Probabilistic Polynomial Time Computations.

A. Pgourtzis, K. Sharma, Efstathios K. Zachos

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1989

On Completeness and Soundness in Interactive Proof Systems.

Martin Fürer, Oded Goldreich, Yishay Mansour, Michael Sipser, Stathis Zachos

Adv. Comput. Res., 1989

1988

Probabilistic Quantifiers and Games.

Stathis Zachos

J. Comput. Syst. Sci., 1988

1987

Does co-NP Have Short Interactive Proofs?

Ravi B. Boppana, Johan Håstad, Stathis Zachos

Inf. Process. Lett., 1987

Probabalistic Quantifiers vs. Distrustful Adversaries.

Stathis Zachos, Martin Fürer

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986

A Decisive Characterization of BPP

Stathis Zachos, Hans Heller

Inf. Control., 1986

Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview.

Stathis Zachos

Proceedings of the Structure in Complexity Theory, 1986

1984

A New Characterization of BPP.

Stathis Zachos

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984

1983

Two remarks on the power of counting.

Christos H. Papadimitriou, Stathis Zachos

Proceedings of the Theoretical Computer Science, 1983

1982

Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations

Stathis Zachos

Inf. Control., September, 1982