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

• 1981
• 
  Jürgen Albert, Lutz M. Wegner:
  Languages with Homomorphic Replacements. Theor. Comput. Sci. 16: 291-305 (1981)
• 
  Francine Berman, Mike Paterson:
  Propositional Dynamic Logic is Weaker without Tests. Theor. Comput. Sci. 16: 321-328 (1981)
• 
  Ronald V. Book, Colm Ó'Dúnlaing:
  Testing for the Church-Rosser Property. Theor. Comput. Sci. 16: 223-229 (1981)
• 
  Walter A. Burkhard, Michael L. Fredman, Daniel J. Kleitman:
  Inherent Complexity Trade-Offs for Range Query Problems. Theor. Comput. Sci. 16: 279-290 (1981)
• 
  J. Lawrence Carter, Ronald Fagin:
  A Note on the Existence of Continuous Functionals. Theor. Comput. Sci. 16: 231-235 (1981)
• 
  L. Csirmaz:
  Programs and Program Verifications in a General Setting. Theor. Comput. Sci. 16: 199-210 (1981)
• 
  Herbert Edelsbrunner, Hermann A. Maurer:
  A Space-Optimal Solution of General Region Location. Theor. Comput. Sci. 16: 329-336 (1981)
• 
  Andrzej Ehrenfeucht, Grzegorz Rozenberg:
  On the Subword Complexity of Square-Free D0L Languages. Theor. Comput. Sci. 16: 25-32 (1981)
• 
  Giulia Galbiati:
  M. J. Fischer: On the Complexity of 2-Output Boolean Networks. Theor. Comput. Sci. 16: 177-185 (1981)
• 
  Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung, J. W. Pruitt, C. K. Wong:
  Record Allocation for Minimizing Seek Delay. Theor. Comput. Sci. 16: 307-319 (1981)
• 
  Matthias Jantzen:
  On a Special Monoid with a Single Defining Relation. Theor. Comput. Sci. 16: 61-73 (1981)
• 
  H. C. M. Kleijn, Grzegorz Rozenberg:
  Context-Free Like Restrictions on Selective Rewriting. Theor. Comput. Sci. 16: 237-269 (1981)
• 
  K. Lam, M. K. Siu, Clement T. Yu:
  A Generalized Counter Scheme. Theor. Comput. Sci. 16: 271-278 (1981)
• 
  Karl J. Lieberherr:
  Uniform Complexity and Digital Signatures. Theor. Comput. Sci. 16: 99-110 (1981)
• 
  Michael G. Main, David B. Benson:
  Free Upper Regular Bands. Theor. Comput. Sci. 16: 93-98 (1981)
• 
  V. L. Nguyen, Jean-Louis Lassez:
  A Dual Problem to Least Fixed Points. Theor. Comput. Sci. 16: 211-221 (1981)
• 
  Jean-Pierre Pécuchet:
  Sur la Determination du Rang d'une Equation dans le Monoide Libre. Theor. Comput. Sci. 16: 337-340 (1981)
• 
  Jan Pittl:
  On LLP(k) Grammars and Languages. Theor. Comput. Sci. 16: 149-175 (1981)
• 
  Kari-Jouko Räihä, Esko Ukkonen:
  The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete. Theor. Comput. Sci. 16: 187-198 (1981)
• 
  John C. Shepherdson:
  In Memoriam Calvin C. Elgot. Theor. Comput. Sci. 16: 1-4 (1981)
• 
  Janos Simon:
  On Tape-Bounded Probabilistic Turing Machine Acceptors. Theor. Comput. Sci. 16: 75-91 (1981)
• 
  Satoru Takasu, Sukemitsu Kawabata:
  A Logical Basis for Programming Methodology. Theor. Comput. Sci. 16: 43-60 (1981)
• 
  Ren-ji Tao:
  On the Computational Power of Automata with Time or Space Bounded by Ackermann's or Superexponential Functions. Theor. Comput. Sci. 16: 115-148 (1981)
• 
  Ju. M. Vazenin:
  Sur la Liaison Entre Problemes Combinatoires et Algorithmiques. Theor. Comput. Sci. 16: 33-41 (1981)
• 
  Klaus Weihrauch, Ulrich Schreiber:
  Embedding Metric Spaces Into CPO's. Theor. Comput. Sci. 16: 5-24 (1981)