• 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

• 1981
• 
  Joffroy Beauquier:
  Substitution of Semi-AFL'S. Theor. Comput. Sci. 14: 187-193 (1981)
• 
  Walter Bucher:
  A Note on a Problem in the Theory of Grammatical Complexity. Theor. Comput. Sci. 14: 337-344 (1981)
• 
  Walter Bucher, Hermann A. Maurer, Karel Culík II, Detlef Wotschke:
  Concise Description of Finite Languages. Theor. Comput. Sci. 14: 227-246 (1981)
• 
  G. Callegarin, Giuliano Pacini:
  About the Implementability and the Power of Equationally Defined Data Abstractions. Theor. Comput. Sci. 14: 305-315 (1981)
• 
  Zvi Galil:
  On the Theoretical Efficiency of Various Network Flow Algorithms. Theor. Comput. Sci. 14: 103-111 (1981)
• 
  Jean H. Gallier:
  DPDA's in 'Atomic Normal Form' and Applications to Equivalence Problems. Theor. Comput. Sci. 14: 155-186 (1981)
• 
  Georg Gato:
  Some Elements of a Galois Theory of the Structure and Complexity of the Tree Automorphism Problem. Theor. Comput. Sci. 14: 1-17 (1981)
• 
  Matthias Jantzen:
  The Power of Synchronizing Operations on Strings. Theor. Comput. Sci. 14: 127-154 (1981)
• 
  Kurt Jensen:
  Coloured Petri Nets and the Invariant-Method. Theor. Comput. Sci. 14: 317-336 (1981)
• 
  Dexter Kozen, Rohit Parikh:
  An Elementary Proof of the Completness of PDL. Theor. Comput. Sci. 14: 113-118 (1981)
• 
  Michel Latteux:
  A Propos du Lemme de Substitution. Theor. Comput. Sci. 14: 119-123 (1981)
• 
  Ernst L. Leiss:
  On Generalized Language Equations. Theor. Comput. Sci. 14: 63-77 (1981)
• 
  Timothy J. Long:
  On gamma-Reducibility Versus Polynomial Time Many-One Reducibility. Theor. Comput. Sci. 14: 91-101 (1981)
• 
  Akira Maruoka, Masayuki Kimura, Nobuyoshi Shoji:
  Pattern Decomposition for Tessellation Automata. Theor. Comput. Sci. 14: 211-226 (1981)
• 
  Jürgen Schulte Mönting:
  Merging of 4 or 5 Elements with n Elements. Theor. Comput. Sci. 14: 19-37 (1981)
• 
  Shlomo Moran:
  General Approximation Algorithms for some Arithmetical Combinatorial Problems. Theor. Comput. Sci. 14: 289-303 (1981)
• 
  Yasuaki Nishitani, Namio Honda:
  The Firing Squad Synchronization Problem for Graphs. Theor. Comput. Sci. 14: 39-61 (1981)
• 
  Arnon Rosenthal:
  Optimal Algorithms for Sensitivity Analysis in Associative Multiplication Problems. Theor. Comput. Sci. 14: 79-90 (1981)
• 
  Grzegorz Rozenberg, R. Verraedt:
  On Pure, Terminal Invariant and Nonterminal Invariant Interpretations of E0L Forms. Theor. Comput. Sci. 14: 267-288 (1981)
• 
  Janusz Stoklosa, Wojciech Zakowski:
  Computations of (alpha, k)-Machines. Theor. Comput. Sci. 14: 247-265 (1981)
• 
  Denis Thérien:
  Classification of Finite Monoids: The Language Approach. Theor. Comput. Sci. 14: 195-208 (1981)