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

• 1989
• 
  Martín Abadi:
  The Power of Temporal Proofs. Theor. Comput. Sci. 65(1): 35-83 (1989)
• 
  Jean-Paul Allouche:
  On a Sequence of Rational Functions. Theor. Comput. Sci. 65(2): 123-130 (1989)
• 
  François Blanchard:
  beta-Expansions and Symbolic Dynamics. Theor. Comput. Sci. 65(2): 131-141 (1989)
• 
  Noëlle Bleuzen-Guernalec:
  On a Possible Classification of Real-Time Constructed Sequences. Theor. Comput. Sci. 65(2): 143-148 (1989)
• 
  F. Michel Dekking:
  On the Probability of Occurrence of Labelled Subtrees of a Randomly Labelled Tree. Theor. Comput. Sci. 65(2): 149-152 (1989)
• 
  Jean-Marie Dumont, Alain Thomas:
  Systemes de Numeration et Fonctions Fractales Relatifs aux Substitutions. Theor. Comput. Sci. 65(2): 153-169 (1989)
• 
  Patrice Enjalbert, Luis Fariñas del Cerro:
  Modal Resolution in Clausal Form. Theor. Comput. Sci. 65(1): 1-33 (1989)
• 
  Michel Mendès France, Alfred J. van der Poorten:
  From Geometry to Euler Identities. Theor. Comput. Sci. 65(2): 213-220 (1989)
• 
  Georges Hansel, Dominique Perrin:
  Rational Probability Measures. Theor. Comput. Sci. 65(2): 171-188 (1989)
• 
  Thérèse Hardin:
  Confluence Results for the Pure Strong Categorical Logic CCL: lambda-Calculi as Subsystems of CCL. Theor. Comput. Sci. 65(3): 291-342 (1989)
• 
  Peter Hellekalek, Gerhard Larcher:
  On Weyl Sums and Skew Products over Irrational Rotations. Theor. Comput. Sci. 65(2): 189-196 (1989)
• 
  Cor Kraaikamp:
  Statistic and Ergodic Properties of Minkowski's Diagonal Continued Fraction. Theor. Comput. Sci. 65(2): 197-212 (1989)
• 
  Filippo Mignosi:
  Infinite Words with Linear Subword Complexity. Theor. Comput. Sci. 65(2): 221-242 (1989)
• 
  Makoto Mori:
  On the Fredholm Determinant of a Piecewise Linear Transformation. Theor. Comput. Sci. 65(2): 243-248 (1989)
• 
  Brigitte Mossé:
  q-Adic Spectral Analysis of Some Arithmetic Sequences. Theor. Comput. Sci. 65(2): 249-263 (1989)
• 
  Antonio Restivo:
  Finitely Generated Sofic Systems. Theor. Comput. Sci. 65(2): 265-270 (1989)
• 
  John C. Shepherdson:
  A Sound and Complete Semantics for a Version of Negation as Failure. Theor. Comput. Sci. 65(3): 343-371 (1989)
• 
  Satish R. Thatte:
  Full Abstraction and Limiting Completeness in Equational Languages. Theor. Comput. Sci. 65(1): 85-119 (1989)
• 
  Hirofumi Yokouchi:
  Church-Rosser Theorem for a Rewriting System on Categorical Combinators. Theor. Comput. Sci. 65(3): 271-290 (1989)