• 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 13 matches

• 2006
• 
  Hanifa Boucheneb, Rachid Hadjidj:
  CTL^* model checking for time Petri nets. Theor. Comput. Sci. 353(1-3): 208-227 (2006)
• 
  Valentin Goranko, Govert van Drimmelen:
  Complete axiomatization and decidability of Alternating-time temporal logic. Theor. Comput. Sci. 353(1-3): 93-117 (2006)
• 
  Sven Hartmann, Sebastian Link:
  On a problem of Fagin concerning multivalued dependencies in relational databases. Theor. Comput. Sci. 353(1-3): 53-62 (2006)
• 
  Florentin Ipate:
  Testing against a non-controllable stream X-machine using state counting. Theor. Comput. Sci. 353(1-3): 291-316 (2006)
• 
  Mark Kambites:
  Automatic semigroups and categories. Theor. Comput. Sci. 353(1-3): 272-290 (2006)
• 
  Norihiro Kamide:
  Linear and affine logics with temporal, spatial and epistemic operators. Theor. Comput. Sci. 353(1-3): 165-207 (2006)
• 
  François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
  Efficient timed model checking for discrete-time systems. Theor. Comput. Sci. 353(1-3): 249-271 (2006)
• 
  Natalia López, Manuel Núñez, Ismael Rodríguez:
  Specification, testing and implementation relations for symbolic-probabilistic systems. Theor. Comput. Sci. 353(1-3): 228-248 (2006)
• 
  Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis:
  Automatic workflow verification and generation. Theor. Comput. Sci. 353(1-3): 71-92 (2006)
• 
  John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague:
  A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols. Theor. Comput. Sci. 353(1-3): 118-164 (2006)
• 
  Lutz Schröder:
  The HASCASL prologue: Categorical syntax and semantics of the partial lambda-calculus. Theor. Comput. Sci. 353(1-3): 1-25 (2006)
• 
  Wenhui Zhang:
  Structure of proofs and the complexity of cut elimination. Theor. Comput. Sci. 353(1-3): 63-70 (2006)
• 
  Zhaohui Zhu:
  Similarity between preferential models. Theor. Comput. Sci. 353(1-3): 26-52 (2006)