dblp.uni-trier.dewww.uni-trier.de

Stathis Zachos

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2007
23EEChristos Nomikos, Aris Pagourtzis, Stathis Zachos: Randomized and Approximation Algorithms for Blue-Red Matching. MFCS 2007: 715-725
22EEChristodoulos Fragoudakis, Euripides Markou, Stathis Zachos: Maximizing the guarded boundary of an Art Gallery is APX-complete. Comput. Geom. 38(3): 170-180 (2007)
21EEAris Pagourtzis, Katerina Potika, Stathis Zachos: Path multicoloring with fewer colors in spiders and caterpillars. Computing 80(3): 255-274 (2007)
2006
20EEAris Pagourtzis, Stathis Zachos: The Complexity of Counting Functions with Easy Decision Version. MFCS 2006: 741-752
19EEChristos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos: Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost. Computer Networks 50(1): 1-14 (2006)
2005
18EEChristodoulos Fragoudakis, Euripides Markou, Stathis Zachos: How to Place Efficiently Guards and Paintings in an Art Gallery. Panhellenic Conference on Informatics 2005: 145-154
17EEStratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos: Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree. Panhellenic Conference on Informatics 2005: 57-67
2004
16EEChristos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos: Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. NETWORKING 2004: 150-161
2003
15EEEuripides Markou, Stathis Zachos, Christodoulos Fragoudakis: Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete. CIAC 2003: 24-35
14EEChristos Nomikos, Aris Pagourtzis, Stathis Zachos: Minimizing Request Blocking in All-Optical Rings. INFOCOM 2003
13EEChristos Nomikos, Aris Pagourtzis, Stathis Zachos: Satisfying a maximum number of pre-routed requests in all-optical rings. Computer Networks 42(1): 55-63 (2003)
2001
12EEAggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos: Acceptor-Definable Counting Classes. Panhellenic Conference on Informatics 2001: 453-463
11EEChristos Nomikos, Aris Pagourtzis, Stathis Zachos: Routing and path multicoloring. Inf. Process. Lett. 80(5): 249-256 (2001)
2000
10EECostas D. Koutras, Stathis Zachos: Many-Valued Reflexive Autoepistemic Logic. Logic Journal of the IGPL 8(1): (2000)
1999
9 Costas D. Koutras, George Koletsos, Stathis Zachos: Many-Valued Modal Non-Monotonic Reasoning: Sequential Stable Sets and Logics with Linear Truth Spaces. Fundam. Inform. 38(3): 281-324 (1999)
1988
8 Stathis Zachos: Probabilistic Quantifiers and Games. J. Comput. Syst. Sci. 36(3): 433-451 (1988)
1987
7 Stathis Zachos, Martin Furer: Probabalistic Quantifiers vs. Distrustful Adversaries. FSTTCS 1987: 443-455
6 Ravi B. Boppana, Johan Håstad, Stathis Zachos: Does co-NP Have Short Interactive Proofs? Inf. Process. Lett. 25(2): 127-132 (1987)
1986
5 Stathis Zachos: Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview. Structure in Complexity Theory Conference 1986: 383-400
4 Stathis Zachos, Hans Heller: A Decisive Characterization of BPP Information and Control 69(1-3): 125-135 (1986)
1984
3 Stathis Zachos: A New Characterization of BPP. FSTTCS 1984: 179-187
1983
2 Christos H. Papadimitriou, Stathis Zachos: Two remarks on the power of counting. Theoretical Computer Science 1983: 269-276
1982
1 Stathis Zachos: Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations Information and Control 54(3): 143-154 (1982)

Coauthor Index

1Ravi B. Boppana [6]
2Christodoulos Fragoudakis [15] [18] [22]
3Martin Furer [7]
4Johan Håstad [6]
5Hans Heller [4]
6Stratis Ioannidis [17]
7Aggelos Kiayias [12]
8George Koletsos [9]
9Costas D. Koutras [9] [10]
10Euripides Markou [15] [18] [22]
11Christos Nomikos [11] [13] [14] [16] [17] [19] [23]
12Aris Pagourtzis [11] [12] [13] [14] [16] [17] [19] [20] [21] [23]
13Christos H. Papadimitriou [2]
14Katerina Potika [16] [19] [21]
15Kiron Sharma [12]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)