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

• 1992
• 
  Paola Bonizzoni, Giancarlo Mauri:
  On Automata on Infinite Trees. Theor. Comput. Sci. 93(2): 227-244 (1992)
• 
  Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant:
  An Arithmetic Model of Computation Equivalent to Threshold Circuits. Theor. Comput. Sci. 93(2): 303-319 (1992)
• 
  Patrick Dehornoy:
  A Criterion for Proving Noetherianity of a Relation. Theor. Comput. Sci. 93(2): 321-325 (1992)
• 
  Andreas Goerdt:
  Unrestricted Resolution versus N-Resolution. Theor. Comput. Sci. 93(1): 159-167 (1992)
• 
  Peter G. Harrison, Hessam Khoshnevisan:
  A New Approach to Recursion Removal. Theor. Comput. Sci. 93(1): 91-113 (1992)
• 
  Thomas Herbst:
  On a Kind of Fatou Property of Context-Free Groups. Theor. Comput. Sci. 93(2): 327-331 (1992)
• 
  Kunihiko Hiraishi, Atsunobu Ichikawa:
  On Structural Conditions for Weak Persistency and Semilinearity of Petri Nets. Theor. Comput. Sci. 93(2): 185-199 (1992)
• 
  Zvi M. Kedem, Krishna V. Palem:
  Optimal Parallel Algorithms for Forest and Term Matching. Theor. Comput. Sci. 93(2): 245-264 (1992)
• 
  A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
  On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. Theor. Comput. Sci. 93(1): 1-41 (1992)
• 
  Guy Louchard, B. Randrianarimanana, René Schott:
  Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis. Theor. Comput. Sci. 93(2): 201-225 (1992)
• 
  Pierre Péladeau:
  Logically Defined Subsets of N k. Theor. Comput. Sci. 93(2): 169-183 (1992)
• 
  Prakash V. Ramanan:
  Testing the Optimality of Alphabetic Trees. Theor. Comput. Sci. 93(2): 279-301 (1992)
• 
  György E. Révész:
  A List-Oriented Extension of the lambda-Calculus Satisfying the Church-Rosser Theorem. Theor. Comput. Sci. 93(1): 75-89 (1992)
• 
  V. S. Subrahmanian:
  Paraconsistent Disjunctive Deductive Databases. Theor. Comput. Sci. 93(1): 115-141 (1992)
• 
  Seinosuke Toda:
  Restricted Relativizations of Probablistic Polynomial Time. Theor. Comput. Sci. 93(2): 265-277 (1992)
• 
  Sándor Vágvölgyi:
  Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead. Theor. Comput. Sci. 93(1): 43-74 (1992)
• 
  Guo-Qiang Zhang:
  Stable Neighbourboods. Theor. Comput. Sci. 93(1): 143-157 (1992)