• 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

• 1985
• 
  Michael H. Albert, John Lawrence:
  A Proof of Ehrenfeucht's Conjecture. Theor. Comput. Sci. 41: 121-123 (1985)
• 
  Martin W. Bunder:
  Possible Forms of Evaluation or Reduction in Martin-Löf Type Theory. Theor. Comput. Sci. 41: 113-120 (1985)
• 
  Virgil Emil Cazanescu:
  On Context-Free Trees. Theor. Comput. Sci. 41: 33-50 (1985)
• 
  Eric Goles Ch.:
  Dynamics of Positive Automata Networks. Theor. Comput. Sci. 41: 19-32 (1985)
• 
  Elias Dahlhaus, Haim Gaifman:
  Concerning Two-Adjacent Context-Free Languages. Theor. Comput. Sci. 41: 169-184 (1985)
• 
  Philippe Gohon:
  An Algorithm to Decide Whether a Rational Subset of Nk is Recognizable. Theor. Comput. Sci. 41: 51-59 (1985)
• 
  John Grant, Jack Minker:
  Inferences for Numerical Dependencies. Theor. Comput. Sci. 41: 271-287 (1985)
• 
  Susumu Hayashi:
  Adjunction of Semifunctors: Categorical Structures in Nonextensional Lambda Calculus. Theor. Comput. Sci. 41: 95-104 (1985)
• 
  Friedhelm Meyer auf der Heide:
  Simulating Probabilistic by Deterministic Algebraic Computation Trees. Theor. Comput. Sci. 41: 325-330 (1985)
• 
  Bettina Helfrich:
  Algorithms to Construct Minkowski Reduced an Hermite Reduced Lattice Bases. Theor. Comput. Sci. 41: 125-139 (1985)
• 
  Sachio Hirokawa:
  Complexity of the Combinator Reduction Machine. Theor. Comput. Sci. 41: 289-303 (1985)
• 
  Oscar H. Ibarra, Michael A. Palis, Sam M. Kim:
  Fast Parallel Language Recognition by Cellular Automata. Theor. Comput. Sci. 41: 231-246 (1985)
• 
  Costas S. Iliopoulos:
  Computing in General Abelian Groups is Hard. Theor. Comput. Sci. 41: 81-93 (1985)
• 
  Katsushi Inoue, Itsuo Takanami, Roland Vollmar:
  Alternating On-Line Turing Machines with Only Universal States and Small Space Bounds. Theor. Comput. Sci. 41: 331-339 (1985)
• 
  Juhani Karhumäki:
  A Property of Three-Element Codes. Theor. Comput. Sci. 41: 215-222 (1985)
• 
  Yael Maon:
  On the Equivalence Problem of Compositions of Morphisms and Inverse Morphisms on Context-Free Languages. Theor. Comput. Sci. 41: 105-107 (1985)
• 
  Burkhard Monien, Ivan Hal Sudborough:
  Bandwidth Constrained NP-Complete Problems. Theor. Comput. Sci. 41: 141-167 (1985)
• 
  Gheorghe Paun:
  A Variant of Random Context Grammars: Semi-Conditional Grammars. Theor. Comput. Sci. 41: 1-17 (1985)
• 
  Elisabeth Pelz:
  On the Complexity of Theories of Permutations. Theor. Comput. Sci. 41: 247-269 (1985)
• 
  Wolfgang Reisig:
  Petri Nets with Individual Tokens. Theor. Comput. Sci. 41: 185-213 (1985)
• 
  Evelyne Barbin-Le Rest, Michel Le Rest:
  Sur la Combinatoire des Codes à Deux Mots. Theor. Comput. Sci. 41: 61-80 (1985)
• 
  Giora Slutzki:
  Alternating Tree Automata. Theor. Comput. Sci. 41: 305-318 (1985)
• 
  Hans-Jörg Stoß:
  The Complexity of Evaluating Interpolation Polynomials. Theor. Comput. Sci. 41: 319-323 (1985)
• 
  Jean-Yves Thibon:
  Integrité des Algèbres de Séries Formelles sur un Alphabet Partiellement Commutatif. Theor. Comput. Sci. 41: 109-112 (1985)
• 
  Etsuji Tomita, Kazushi Seino:
  A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable. Theor. Comput. Sci. 41: 223-230 (1985)