Follow
Stathis (Efstathios) Zachos
Stathis (Efstathios) Zachos
CS Professor, NTUA
Verified email at cs.ntua.gr
Title
Cited by
Cited by
Year
Does co-NP have short interactive proofs?
RB Boppana, J Hastad, S Zachos
Information Processing Letters 25 (2), 127-132, 1987
5121987
Two remarks on the power of counting
CH Papadimitriou, SK Zachos
Theoretical Computer Science: 6th Gl-Conference Dortmund, January 5–7, 1983 …, 1982
3361982
Probabilistic quantifiers and games
S Zachos
Journal of Computer and System Sciences 36 (3), 433-451, 1988
821988
A decisive characterization of BPP
S Zachos, H Heller
Information and Control 69 (1-3), 125-135, 1986
801986
Probabilistic quantifiers vs. distrustful adversaries
S Zachos, M Furer
International Conference on Foundations of Software Technology and …, 1987
701987
Probabilistic quantifiers, adversaries, and complexity classes: An overview
S Zachos
Structure in Complexity Theory: Proceedings of the Conference held at the …, 1986
641986
Robustness of probabilistic computational complexity classes under definitional perturbations
S Zachos
Information and Control 54 (3), 143-154, 1982
601982
The complexity of counting functions with easy decision version
A Pagourtzis, S Zachos
Mathematical Foundations of Computer Science 2006: 31st International …, 2006
432006
Routing and path multicoloring
C Nomikos, A Pagourtzis, S Zachos
Information Processing Letters 80 (5), 249-256, 2001
432001
Minimizing request blocking in all-optical rings
C Nomikos, A Pagourtzis, S Zachos
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE …, 2003
352003
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
C Nomikos, A Pagourtzis, K Potika, S Zachos
Computer Networks 50 (1), 1-14, 2006
312006
Networking 2004: Networking Technologies, Services, and Protocols; Performance of Computer and Communications Networks; Mobile and Wireless Communications; Third International …
N Mitrou
Springer Science & Business Media, 2004
222004
Satisfying a maximum number of pre-routed requests in all-optical rings
C Nomikos, A Pagourtzis, S Zachos
Computer Networks 42 (1), 55-63, 2003
222003
Maximizing the guarded boundary of an Art Gallery is APX-complete
C Fragoudakis, E Markou, S Zachos
Computational Geometry 38 (3), 170-180, 2007
212007
Randomized and approximation algorithms for blue-red matching
C Nomikos, A Pagourtzis, S Zachos
Mathematical Foundations of Computer Science 2007: 32nd International …, 2007
202007
Fiber cost reduction and wavelength minimization in multifiber WDM networks
C Nomikos, A Pagourtzis, K Potika, S Zachos
Networking 2004: Networking Technologies, Services, and Protocols …, 2004
202004
Many-valued reflexive autoepistemic logic
CD Koutras, S Zachos
Logic Journal of the IGPL 8 (1), 33-54, 2000
192000
Υπολογιστική κρυπτογραφία
Ε Ζάχος, Α Παγουρτζής, Π Γροντάς
ΣΥΝΔΕΣΜΟΣ ΕΛΛΗΝΙΚΩΝ ΑΚΑΔΗΜΑΪΚΩΝ ΒΙΒΛΙΟΘΗΚΩΝ, Εθνικό Μετσόβιο Πολυτεχνείο, 2015
162015
Neochromatica
P Cheilaris, E Specker, S Zachos
Commentationes Mathematicae Universitatis Carolinae 51 (3), 469-480, 2010
162010
Coloring a maximum number of paths in a graph
C Nomikos, S Zachos
151997
The system can't perform the operation now. Try again later.
Articles 1–20