Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations - Stathis Zachos (Inf. Control., 1982)

Two remarks on the power of counting. - Christos H. Papadimitriou; Stathis Zachos (Theoretical Computer Science, 1983)

A New Characterization of BPP. - Stathis Zachos (FSTTCS, 1984)

Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview. - Stathis Zachos (SCT, 1986)

A Decisive Characterization of BPP - Stathis Zachos; Hans Heller (Inf. Control., 1986)

Probabalistic Quantifiers vs. Distrustful Adversaries. - Stathis Zachos; Martin Fürer (FSTTCS, 1987)

Does co-NP Have Short Interactive Proofs? - Ravi B. Boppana; Johan Håstad; Stathis Zachos (Inf. Process. Lett., 1987)

Probabilistic Quantifiers and Games. - Stathis Zachos (J. Comput. Syst. Sci., 1988)

On Completeness and Soundness in Interactive Proof Systems. - Martin Fürer; Oded Goldreich 001; Yishay Mansour; Michael Sipser; Stathis Zachos (Adv. Comput. Res., 1989)

Tree Models and Probabilistic Polynomial Time Computations. - A. Pgourtzis; K. Sharma; Efstathios K. Zachos (CATS, 1998)

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)

Many-Valued Reflexive Autoepistemic Logic. - Costas D. Koutras; Stathis Zachos (Log. J. IGPL, 2000)

Acceptor-Definable Counting Classes. - Aggelos Kiayias; Aris Pagourtzis; Kiron Sharma; Stathis Zachos (Panhellenic Conference on Informatics, 2001)

Routing and path multicoloring. - Christos Nomikos; Aris Pagourtzis; Stathis Zachos (Inf. Process. Lett., 2001)

Minimizing Request Blocking in All-Optical Rings. - Christos Nomikos; Aris Pagourtzis; Stathis Zachos (INFOCOM, 2003)

Satisfying a maximum number of pre-routed requests in all-optical rings. - Christos Nomikos; Aris Pagourtzis; Stathis Zachos (Comput. Networks, 2003)

Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. - Christos Nomikos; Aris Pagourtzis; Katerina Potika; Stathis Zachos (NETWORKING, 2004)

How to Place Efficiently Guards and Paintings in an Art Gallery. - Christodoulos Fragoudakis; Euripides Markou; Stathis Zachos (Panhellenic Conference on Informatics, 2005)

Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree. - Stratis Ioannidis; Christos Nomikos; Aris Pagourtzis; Stathis Zachos (Panhellenic Conference on Informatics, 2005)

The Complexity of Counting Functions with Easy Decision Version. - Aris Pagourtzis; Stathis Zachos (MFCS, 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)

Randomized and Approximation Algorithms for Blue-Red Matching. - Christos Nomikos; Aris Pagourtzis; Stathis Zachos (MFCS, 2007)

Maximizing the guarded boundary of an Art Gallery is APX-complete. - Christodoulos Fragoudakis; Euripides Markou; Stathis Zachos (Comput. Geom., 2007)

Path multicoloring with fewer colors in spiders and caterpillars. - Aris Pagourtzis; Katerina Potika; Stathis Zachos (Computing, 2007)

Ordered coloring of grids and related graphs. - Amotz Bar-Noy; Panagiotis Cheilaris; Michael Lampis; Valia Mitsou; Stathis Zachos (Theor. Comput. Sci., 2012)

Teaching Programming through Problem Solving: The Role of the Programming Language. - Nikolaos S. Papaspyrou; Stathis Zachos (FedCSIS, 2013)

Random Walks on Some Basic Classes of Digraphs. - Wen-Ju Cheng; Jim Cox; Stathis Zachos (ICTAC, 2013)

Completeness Results for Counting Problems with Easy Decision. - Eleni Bakali; Aggeliki Chalki; Aris Pagourtzis; Petros Pantavos; Stathis Zachos (CIAC, 2017)

Guest column: A panorama of counting problems the decision version of which is in P3. - Eleni Bakali; Aggeliki Chalki; Andreas Göbel 001; Aris Pagourtzis; Stathis Zachos (SIGACT News, 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)

On the Power of Counting the Total Number of Computation Paths of NPTMs. - Eleni Bakali; Aggeliki Chalki; Sotiris Kanellopoulos; Aris Pagourtzis; Stathis Zachos (TAMC, 2024)