Stathis Zachos - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2022

Completeness, approximability and exponential time results for counting problems with easy decision versionAntonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos. TCS, 915:55-73, 2022. [doi]

3Eleni Bakali, Aggeliki Chalki, Andreas Göbel 0001, Aris Pagourtzis, Stathis Zachos. sigact, 53(3):46-68, 2022. [doi]

2017

Completeness Results for Counting Problems with Easy DecisionEleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos. ciac 2017: 55-66 [doi]

2013

Random Walks on Some Basic Classes of DigraphsWen-Ju Cheng, Jim Cox, Stathis Zachos. ictac 2013: 122-140 [doi]

Teaching Programming through Problem Solving: The Role of the Programming LanguageNikolaos S. Papaspyrou, Stathis Zachos. FedCSIS 2013: 1533-1536

2012

Ordered coloring of grids and related graphsAmotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos. TCS, 444:40-51, 2012. [doi]

2009

Ordered Coloring Grids and Related GraphsAmotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos. sirocco 2010: 30-43 [doi]

2007

Maximizing the guarded boundary of an Art Gallery is APX-completeChristodoulos Fragoudakis, Euripides Markou, Stathis Zachos. comgeo, 38(3):170-180, 2007. [doi]

Randomized and Approximation Algorithms for Blue-Red MatchingChristos Nomikos, Aris Pagourtzis, Stathis Zachos. mfcs 2007: 715-725 [doi]

Path multicoloring with fewer colors in spiders and caterpillarsAris Pagourtzis, Katerina Potika, Stathis Zachos. computing, 80(3):255-274, 2007. [doi]

2006

Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber costChristos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos. cn, 50(1):1-14, 2006. [doi]

The Complexity of Counting Functions with Easy Decision VersionAris Pagourtzis, Stathis Zachos. mfcs 2006: 741-752 [doi]

2005

How to Place Efficiently Guards and Paintings in an Art GalleryChristodoulos Fragoudakis, Euripides Markou, Stathis Zachos. pci 2005: 145-154 [doi]

Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded DegreeStratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos. pci 2005: 57-67 [doi]

2004

Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM NetworksChristos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos. networking 2004: 150-161 [doi]

2003

Maximizing the Guarded Boundary of an Art Gallery Is APX-CompleteEuripides Markou, Stathis Zachos, Christodoulos Fragoudakis. ciac 2003: 24-35 [doi]

Minimizing Request Blocking in All-Optical RingsChristos Nomikos, Aris Pagourtzis, Stathis Zachos. infocom 2003: 1355-1361 [doi]

Satisfying a maximum number of pre-routed requests in all-optical ringsChristos Nomikos, Aris Pagourtzis, Stathis Zachos. cn, 42(1):55-63, 2003. [doi]

2001

Acceptor-Definable Counting ClassesAggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos. pci 2003: 453-463 [doi]

Routing and path multicoloringChristos Nomikos, Aris Pagourtzis, Stathis Zachos. ipl, 80(5):249-256, 2001. [doi]

2000

Many-Valued Reflexive Autoepistemic LogicCostas D. Koutras, Stathis Zachos. igpl, 8(1):33-54, 2000. [doi]

1999

Many-Valued Modal Non-Monotonic Reasoning: Sequential Stable Sets and Logics with Linear Truth SpacesCostas D. Koutras, George Koletsos, Stathis Zachos. FUIN, 38(3):281-324, 1999.

1989

On Completeness and Soundness in Interactive Proof SystemsMartin Fürer, Oded Goldreich, Yishay Mansour, Michael Sipser, Stathis Zachos. acr, 5:429-442, 1989.

1988

Probabilistic Quantifiers and GamesStathis Zachos. jcss, 36(3):433-451, 1988.

1987

Does co-NP Have Short Interactive Proofs?Ravi B. Boppana, Johan Håstad, Stathis Zachos. ipl, 25(2):127-132, 1987.

Probabalistic Quantifiers vs. Distrustful AdversariesStathis Zachos, Martin Furer. fsttcs 1987: 443-455

1986

Probabilistic Quantifiers, Adversaries, and Complexity Classes: An OverviewStathis Zachos. cocoon 1986: 383-400

A Decisive Characterization of BPPStathis Zachos, Hans Heller. iandc, 69(1-3):125-135, April/May/June 1986.

1984

A New Characterization of BPPStathis Zachos. fsttcs 1984: 179-187

1983

Two remarks on the power of countingChristos H. Papadimitriou, Stathis Zachos. tcs 1982: 269-276

1982

Robustness of Probabilistic Computational Complexity Classes under Definitional PerturbationsStathis Zachos. iandc, 54(3):143-154, September 1982.

Sign in or sign up to see more results.

runs on WebDSL