• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 34 matches

• 2023
• 
  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
• 
  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 P³. SIGACT News 53(3): 46-68 (2022)
• 
  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)
• 2017
• 
  Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Fürer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika:
  Stathis Zachos at 70! CIAC 2017: 469-484
• 
  Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos:
  Completeness Results for Counting Problems with Easy Decision. CIAC 2017: 55-66
• 2013
• 
  Nikolaos S. Papaspyrou, Stathis Zachos:
  Teaching Programming through Problem Solving: The Role of the Programming Language. FedCSIS 2013: 1533-1536
• 
  Wen-Ju Cheng, Jim Cox, Stathis Zachos:
  Random Walks on Some Basic Classes of Digraphs. ICTAC 2013: 122-140
• 2012
• 
  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)
• 2009
• 
  Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos:
  Ordered Coloring Grids and Related Graphs. SIROCCO 2009: 30-43
• 2007
• 
  Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos:
  Maximizing the guarded boundary of an Art Gallery is APX-complete. Comput. Geom. 38(3): 170-180 (2007)
• 
  Aris Pagourtzis, Katerina Potika, Stathis Zachos:
  Path multicoloring with fewer colors in spiders and caterpillars. Computing 80(3): 255-274 (2007)
• 
  Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
  Randomized and Approximation Algorithms for Blue-Red Matching. MFCS 2007: 715-725
• 2006
• 
  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)
• 
  Aris Pagourtzis, Stathis Zachos:
  The Complexity of Counting Functions with Easy Decision Version. MFCS 2006: 741-752
• 2005
• 
  Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos:
  How to Place Efficiently Guards and Paintings in an Art Gallery. Panhellenic Conference on Informatics 2005: 145-154
• 
  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
• 2004
• 
  Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos:
  Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. NETWORKING 2004: 150-161
• 2003
• 
  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)
• 
  Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis:
  Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete. CIAC 2003: 24-35
• 
  Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
  Minimizing Request Blocking in All-Optical Rings. INFOCOM 2003: 1355-1361
• 2001
• 
  Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
  Routing and path multicoloring. Inf. Process. Lett. 80(5): 249-256 (2001)
• 
  Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos:
  Acceptor-Definable Counting Classes. Panhellenic Conference on Informatics 2001: 453-463
• 2000
• 
  Costas D. Koutras, Stathis Zachos:
  Many-Valued Reflexive Autoepistemic Logic. Log. J. IGPL 8(1): 33-54 (2000)
• 1999
• 
  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
• 
  A. Pgourtzis, K. Sharma, Efstathios K. Zachos:
  Tree Models and Probabilistic Polynomial Time Computations. CATS 1998: 291-304
• 1989
• 
  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
• 
  Stathis Zachos:
  Probabilistic Quantifiers and Games. J. Comput. Syst. Sci. 36(3): 433-451 (1988)
• 1987
• 
  Ravi B. Boppana, Johan Håstad, Stathis Zachos:
  Does co-NP Have Short Interactive Proofs? Inf. Process. Lett. 25(2): 127-132 (1987)
• 
  Stathis Zachos, Martin Fürer:
  Probabalistic Quantifiers vs. Distrustful Adversaries. FSTTCS 1987: 443-455
• 1986
• 
  Stathis Zachos, Hans Heller:
  A Decisive Characterization of BPP. Inf. Control. 69(1-3): 125-135 (1986)

skipping 4 more matches