default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStathis Zachos
Person information
- affiliation: National Technical University of Athen, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Eleni Bakali, Aggeliki Chalki
, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos:
On the Power of Counting the Total Number of Computation Paths of NPTMs. TAMC 2024: 209-220- 2023
- [i1]Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos:
On the power of counting the total number of computation paths of NPTMs. CoRR abs/2306.11614 (2023) - 2022
- [j15]Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos:
Guest column: A panorama of counting problems the decision version of which is in P3. SIGACT News 53(3): 46-68 (2022) - [j14]Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos:
Completeness, approximability and exponential time results for counting problems with easy decision version. Theor. Comput. Sci. 915: 55-73 (2022)
2010 – 2019
- 2017
- [c17]Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos:
Completeness Results for Counting Problems with Easy Decision. CIAC 2017: 55-66 - 2013
- [c16]Nikolaos S. Papaspyrou, Stathis Zachos:
Teaching Programming through Problem Solving: The Role of the Programming Language. FedCSIS 2013: 1533-1536 - [c15]Wen-Ju Cheng, Jim Cox, Stathis Zachos:
Random Walks on Some Basic Classes of Digraphs. ICTAC 2013: 122-140 - 2012
- [j13]Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos:
Ordered coloring of grids and related graphs. Theor. Comput. Sci. 444: 40-51 (2012)
2000 – 2009
- 2009
- [c14]Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos:
Ordered Coloring Grids and Related Graphs. SIROCCO 2009: 30-43 - 2007
- [j12]Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos:
Maximizing the guarded boundary of an Art Gallery is APX-complete. Comput. Geom. 38(3): 170-180 (2007) - [j11]Aris Pagourtzis, Katerina Potika, Stathis Zachos:
Path multicoloring with fewer colors in spiders and caterpillars. Computing 80(3): 255-274 (2007) - [c13]Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Randomized and Approximation Algorithms for Blue-Red Matching. MFCS 2007: 715-725 - 2006
- [j10]Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos:
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost. Comput. Networks 50(1): 1-14 (2006) - [c12]Aris Pagourtzis, Stathis Zachos:
The Complexity of Counting Functions with Easy Decision Version. MFCS 2006: 741-752 - 2005
- [c11]Stratis 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 - [c10]Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos:
How to Place Efficiently Guards and Paintings in an Art Gallery. Panhellenic Conference on Informatics 2005: 145-154 - 2004
- [c9]Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos:
Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. NETWORKING 2004: 150-161 - 2003
- [j9]Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Satisfying a maximum number of pre-routed requests in all-optical rings. Comput. Networks 42(1): 55-63 (2003) - [c8]Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis:
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete. CIAC 2003: 24-35 - [c7]Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Minimizing Request Blocking in All-Optical Rings. INFOCOM 2003: 1355-1361 - 2001
- [j8]Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Routing and path multicoloring. Inf. Process. Lett. 80(5): 249-256 (2001) - [c6]Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos:
Acceptor-Definable Counting Classes. Panhellenic Conference on Informatics 2001: 453-463 - 2000
- [j7]Costas D. Koutras, Stathis Zachos:
Many-Valued Reflexive Autoepistemic Logic. Log. J. IGPL 8(1): 33-54 (2000)
1990 – 1999
- 1999
- [j6]Costas D. Koutras, George Koletsos, Stathis Zachos:
Many-Valued Modal Non-Monotonic Reasoning: Sequential Stable Sets and Logics with Linear Truth Spaces. Fundam. Informaticae 38(3): 281-324 (1999) - 1998
- [c5]A. Pgourtzis, K. Sharma, Efstathios K. Zachos:
Tree Models and Probabilistic Polynomial Time Computations. CATS 1998: 291-304
1980 – 1989
- 1989
- [j5]Martin Fürer, Oded Goldreich, Yishay Mansour, Michael Sipser, Stathis Zachos:
On Completeness and Soundness in Interactive Proof Systems. Adv. Comput. Res. 5: 429-442 (1989) - 1988
- [j4]Stathis Zachos:
Probabilistic Quantifiers and Games. J. Comput. Syst. Sci. 36(3): 433-451 (1988) - 1987
- [j3]Ravi B. Boppana, Johan Håstad, Stathis Zachos:
Does co-NP Have Short Interactive Proofs? Inf. Process. Lett. 25(2): 127-132 (1987) - [c4]Stathis Zachos, Martin Fürer:
Probabalistic Quantifiers vs. Distrustful Adversaries. FSTTCS 1987: 443-455 - 1986
- [j2]Stathis Zachos, Hans Heller:
A Decisive Characterization of BPP. Inf. Control. 69(1-3): 125-135 (1986) - [c3]Stathis Zachos:
Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview. SCT 1986: 383-400 - 1984
- [c2]Stathis Zachos:
A New Characterization of BPP. FSTTCS 1984: 179-187 - 1983
- [c1]Christos H. Papadimitriou, Stathis Zachos:
Two remarks on the power of counting. Theoretical Computer Science 1983: 269-276 - 1982
- [j1]Stathis Zachos:
Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations. Inf. Control. 54(3): 143-154 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-19 00:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
