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

• 1979
• 
  Edward A. Ashcroft, Faith E. Fich:
  A Generalized Setting for Fixpoint Theory. Theor. Comput. Sci. 9: 243-256 (1979)
• 
  Raymond Aubin:
  Mechanizing Structural Induction Part I: Formal System. Theor. Comput. Sci. 9: 329-345 (1979)
• 
  Raymond Aubin:
  Mechanizing Structural Induction Part II: Strategies. Theor. Comput. Sci. 9: 347-362 (1979)
• 
  Jan A. Bergstra, Jan Willem Klop:
  Church-Rosser Strategies in the Lambda Calculus. Theor. Comput. Sci. 9: 27-38 (1979)
• 
  Stephen L. Bloom, Ralph Tindell:
  Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes. Theor. Comput. Sci. 9: 265-286 (1979)
• 
  Gilles Christol:
  Ensembles Presque Periodiques k-Reconnaissables. Theor. Comput. Sci. 9: 141-145 (1979)
• 
  Jean-Pierre Duval:
  Periodes et Repetitions des Mots du Monoide Libre. Theor. Comput. Sci. 9: 17-26 (1979)
• 
  Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin:
  The Number of Registers Required for Evaluating Arithmetic Expressions. Theor. Comput. Sci. 9: 99-125 (1979)
• 
  Irène Guessarian:
  Program Transformations and Algebraic Semantics. Theor. Comput. Sci. 9: 39-65 (1979)
• 
  Michael A. Harrison, Ivan M. Havel, Amiram Yehudai:
  On Equivalence of Grammars Through Transformation Trees. Theor. Comput. Sci. 9: 173-205 (1979)
• 
  Katsushi Inoue, Itsuo Takanami, Akira Nakamura, Tadashi Ae:
  One-Way Simple Multihead Finite Automata. Theor. Comput. Sci. 9: 311-328 (1979)
• 
  Juhani Karhumäki:
  On Commutative DT0L Systems. Theor. Comput. Sci. 9: 207-220 (1979)
• 
  Anton Nijholt:
  Simple Chain Grammars and Languages. Theor. Comput. Sci. 9: 287-309 (1979)
• 
  Dominique Perrin:
  La Representation Ergodique d'un Automate fini. Theor. Comput. Sci. 9: 221-241 (1979)
• 
  David A. Plaisted:
  Fast Verification, Testing, and Generation of Large Primes. Theor. Comput. Sci. 9: 1-16 (1979)
• 
  Christophe Reutenauer:
  Sur les Series Associees a Certains Systemes de Lindenmayer. Theor. Comput. Sci. 9: 363-375 (1979)
• 
  F. Rodriguez:
  Familles de Langages Fermees par Crochet Ouvert. Theor. Comput. Sci. 9: 385-398 (1979)
• 
  Keijo Ruohonen:
  On Some Decidability Problems for HD0L Systems with Nonsingular Parikh Matrices. Theor. Comput. Sci. 9: 377-384 (1979)
• 
  Richard Statman:
  Intuitionistic Propositional Logic is Polynomial-Space Complete. Theor. Comput. Sci. 9: 67-72 (1979)
• 
  Richard Statman:
  The Typed lambda-Calculus is not Elementary Recursive. Theor. Comput. Sci. 9: 73-81 (1979)
• 
  A. Tang:
  Chain Properties in P omega. Theor. Comput. Sci. 9: 153-172 (1979)
• 
  Gerd Wechsung, Andreas Brandstädt:
  A Relation Between Space, Return and Dual Return Complexities. Theor. Comput. Sci. 9: 127-140 (1979)
• 
  Ingo Wegener:
  Switching Functions Whose Monotone Complexity is Nearly Quadratic. Theor. Comput. Sci. 9: 83-97 (1979)
• 
  Ingo Wegener:
  A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks. Theor. Comput. Sci. 9: 147-150 (1979)