Stathis Zachos

Available identifiers

zbMath Open zachos.stathis-kDBLP10/2770WikidataQ7604112 ScholiaQ7604112MaRDI QIDQ442257

List of research outcomes

Publication	Date of Publication	Type
On the power of counting the total number of computation paths of NPTMs	2024-11-12	Paper
Completeness, approximability and exponential time results for counting problems with easy decision version	2022-05-31	Paper
Completeness Results for Counting Problems with Easy Decision	2017-07-21	Paper
Random Walks on Some Basic Classes of Digraphs	2013-10-04	Paper
Ordered coloring of grids and related graphs	2012-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q3083878	2011-03-23	Paper
Ordered Coloring Grids and Related Graphs	2010-02-24	Paper
Randomized and Approximation Algorithms for Blue-Red Matching	2008-09-17	Paper
Path multicoloring with fewer colors in spiders and caterpillars	2007-11-19	Paper
Maximizing the guarded boundary of an Art Gallery is APX-complete	2007-10-12	Paper
The Complexity of Counting Functions with Easy Decision Version	2007-09-05	Paper
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost	2005-12-07	Paper
https://portal.mardi4nfdi.de/entity/Q4458495	2004-03-18	Paper
Many-valued reflexive autoepistemic logic	2004-01-28	Paper
https://portal.mardi4nfdi.de/entity/Q4437494	2003-12-02	Paper
Satisfying a maximum number of pre-routed requests in all-optical rings.	2003-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4415064	2003-07-28	Paper
Routing and path multicoloring	2002-07-25	Paper
Probabilistic quantifiers and games	1988-01-01	Paper
Does co-NP have short interactive proofs ?	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3792245	1987-01-01	Paper
A decisive characterization of BPP	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3768891	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3715098	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3345785	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4743737	1982-01-01	Paper
Robustness of probabilistic computational complexity classes under definitional perturbations	1982-01-01	Paper

Research outcomes over time

This page was built for person: Stathis Zachos