Stathis Zachos

33 papers A* 1B 4C 5Journal 16Unranked 7
YearRankTypeTitle / Venue / Authors
2024 C conf
On the Power of Counting the Total Number of Computation Paths of NPTMs.
TAMC
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
2023 J jnl
On the power of counting the total number of computation paths of NPTMs.
CoRR
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
2022 J jnl
Completeness, approximability and exponential time results for counting problems with easy decision version.
Theor. Comput. Sci.
Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
2022 J jnl
Guest column: A panorama of counting problems the decision version of which is in P
SIGACT News
Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos
2017 C conf
Completeness Results for Counting Problems with Easy Decision.
CIAC
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
2013 C conf
Random Walks on Some Basic Classes of Digraphs.
ICTAC
Wen-Ju Cheng, Jim Cox, Stathis Zachos
2013 C conf
Teaching Programming through Problem Solving: The Role of the Programming Language.
FedCSIS
Nikolaos S. Papaspyrou, Stathis Zachos
2012 J jnl
Ordered coloring of grids and related graphs.
Theor. Comput. Sci.
Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos
2009 B conf
Ordered Coloring Grids and Related Graphs.
SIROCCO
Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos
2007 J jnl
Maximizing the guarded boundary of an Art Gallery is APX-complete.
Comput. Geom.
Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos
2007 J jnl
Path multicoloring with fewer colors in spiders and caterpillars.
Computing
Aris Pagourtzis, Katerina Potika, Stathis Zachos
2007 B conf
Randomized and Approximation Algorithms for Blue-Red Matching.
MFCS
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
2006 J jnl
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost.
Comput. Networks
Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos
2006 B conf
The Complexity of Counting Functions with Easy Decision Version.
MFCS
Aris Pagourtzis, Stathis Zachos
2005 — conf
How to Place Efficiently Guards and Paintings in an Art Gallery.
Panhellenic Conference on Informatics
Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos
2005 — conf
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree.
Panhellenic Conference on Informatics
Stratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos
2004 B conf
Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks.
NETWORKING
Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos
2003 C conf
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete.
CIAC
Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis
2003 A* conf
Minimizing Request Blocking in All-Optical Rings.
INFOCOM
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
2003 J jnl
Satisfying a maximum number of pre-routed requests in all-optical rings.
Comput. Networks
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
2001 — conf
Acceptor-Definable Counting Classes.
Panhellenic Conference on Informatics
Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos
2001 J jnl
Routing and path multicoloring.
Inf. Process. Lett.
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
2000 J jnl
Many-Valued Reflexive Autoepistemic Logic.
Log. J. IGPL
Costas D. Koutras, Stathis Zachos
1999 J jnl
Many-Valued Modal Non-Monotonic Reasoning: Sequential Stable Sets and Logics with Linear Truth Spaces.
Fundam. Informaticae
Costas D. Koutras, George Koletsos, Stathis Zachos
1989 J jnl
On Completeness and Soundness in Interactive Proof Systems.
Adv. Comput. Res.
Martin Fürer, Oded Goldreich, Yishay Mansour, Michael Sipser, Stathis Zachos
1988 J jnl
Probabilistic Quantifiers and Games.
J. Comput. Syst. Sci.
Stathis Zachos
1987 J jnl
Does co-NP Have Short Interactive Proofs?
Inf. Process. Lett.
Ravi B. Boppana, Johan Håstad, Stathis Zachos
1987 — conf
Probabalistic Quantifiers vs. Distrustful Adversaries.
FSTTCS
Stathis Zachos, Martin Fürer
1986 J jnl
A Decisive Characterization of BPP
Inf. Control.
Stathis Zachos, Hans Heller
1986 — conf
Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview.
SCT
Stathis Zachos
1984 — conf
A New Characterization of BPP.
FSTTCS
Stathis Zachos
1983 — conf
Two remarks on the power of counting.
Theoretical Computer Science
Christos H. Papadimitriou, Stathis Zachos
1982 J jnl
Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations
Inf. Control.
Stathis Zachos