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

• 2002
• 
  Serge Abiteboul, Sophie Cluet, Tova Milo:
  Correspondence and translation for heterogeneous data. Theor. Comput. Sci. 275(1-2): 179-213 (2002)
• 
  Jirí Adámek, Michel Hébert, Jirí Rosický:
  On abstract data types presented by multiequations. Theor. Comput. Sci. 275(1-2): 427-462 (2002)
• 
  Danièle Beauquier, Anatol Slissenko:
  Decidable verification for reducible timed automata specified in a first order logic with time. Theor. Comput. Sci. 275(1-2): 347-388 (2002)
• 
  Adel Bouhoula, Michaël Rusinowitch:
  Observational proofs by rewriting. Theor. Comput. Sci. 275(1-2): 675-698 (2002)
• 
  Bruce S. Burdick:
  A note on iterated duals of certain topological spaces. Theor. Comput. Sci. 275(1-2): 69-77 (2002)
• 
  Nadia Busi:
  Analysis issues in Petri nets with inhibitor arcs. Theor. Comput. Sci. 275(1-2): 127-177 (2002)
• 
  Felice Cardone:
  A coinductive completeness proof for the equivalence of recursive types. Theor. Comput. Sci. 275(1-2): 575-587 (2002)
• 
  Agostino Cortesi, Agostino Dovier, Elisa Quintarelli, Letizia Tanca:
  Operational and abstract semantics of the query language G-Log. Theor. Comput. Sci. 275(1-2): 521-560 (2002)
• 
  Pierpaolo Degano, Fabio Gadducci, Corrado Priami:
  A causal semantics for CCS via rewriting logic. Theor. Comput. Sci. 275(1-2): 259-282 (2002)
• 
  Dominic Duggan, John Ophel:
  Open and closed scopes for constrained genericity. Theor. Comput. Sci. 275(1-2): 215-258 (2002)
• 
  Ernest G. Manes:
  Taut Monads and T0-spaces. Theor. Comput. Sci. 275(1-2): 79-109 (2002)
• 
  Frank Neven, Thomas Schwentick:
  Query automata over finite trees. Theor. Comput. Sci. 275(1-2): 633-674 (2002)
• 
  Alexander Moshe Rabinovich:
  Finite variability interpretation of monadic logic of order. Theor. Comput. Sci. 275(1-2): 111-125 (2002)
• 
  Maria I. Sessa:
  Approximate reasoning by similarity-based SLD resolution. Theor. Comput. Sci. 275(1-2): 389-426 (2002)
• 
  Iain A. Stewart:
  Program schemes, arrays, Lindström quantifiers and zero-one laws. Theor. Comput. Sci. 275(1-2): 283-310 (2002)
• 
  Walter Vogler:
  Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. Theor. Comput. Sci. 275(1-2): 589-631 (2002)
• 
  Sergei G. Vorobyov:
  forall-Exists⁵-equational theory of context unification is undecidable. Theor. Comput. Sci. 275(1-2): 463-479 (2002)
• 
  Igor Walukiewicz:
  Monadic second-order logic on tree-like structures. Theor. Comput. Sci. 275(1-2): 311-346 (2002)
• 
  Mingsheng Ying:
  Bisimulation indexes and their applications. Theor. Comput. Sci. 275(1-2): 1-68 (2002)
• 
  Mingsheng Ying:
  Additive models of probabilistic processes. Theor. Comput. Sci. 275(1-2): 481-519 (2002)
• 
  Ernst Zimmermann:
  Peirce's Rule in Natural Deduction. Theor. Comput. Sci. 275(1-2): 561-574 (2002)