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

• 1987
• 
  Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig:
  Diagonalizations over Polynomial Time Computable Sets. Theor. Comput. Sci. 51: 177-204 (1987)
• 
  Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
  On the Consistency of Koomen's Fair Abstraction Rule. Theor. Comput. Sci. 51: 129-176 (1987)
• 
  Joffroy Beauquier, Françoise Gire:
  Une Note sur le Théorème de Caractérisation des Générateurs Algébriques. Theor. Comput. Sci. 51: 117-127 (1987)
• 
  Edward G. Belaga:
  Constructive Universal Algebra: An Introduction. Theor. Comput. Sci. 51: 229-238 (1987)
• 
  Béatrice Bérard:
  Literal Shuffle. Theor. Comput. Sci. 51: 281-299 (1987)
• 
  Thomas Beth:
  On the Computational Complexity of the General Discrete Fourier Transform. Theor. Comput. Sci. 51: 331-339 (1987)
• 
  Arturo Carpi:
  On Unambiguous Reductions of Monoids of Unambiguous Relations. Theor. Comput. Sci. 51: 215-220 (1987)
• 
  Philippe le Chenadec:
  Analysis of Dehn's Algorithm by Critical Pairs. Theor. Comput. Sci. 51: 27-52 (1987)
• 
  Zvi Galil, Raffaele Giancarlo:
  Parallel String Matching with k Mismatches. Theor. Comput. Sci. 51: 341-348 (1987)
• 
  Annegret Habel, Hans-Jörg Kreowski:
  Characteristics of Graph Languages Generated by Edge Replacement. Theor. Comput. Sci. 51: 81-115 (1987)
• 
  Tom Head, Barbara Lando:
  Bounded D0L Languages. Theor. Comput. Sci. 51: 255-264 (1987)
• 
  Steven Homer, Timothy J. Long:
  Honest Polynomial Degrees and P=?NP. Theor. Comput. Sci. 51: 265-280 (1987)
• 
  Juraj Hromkovic:
  Reversal-Bounded Nondeterministic Multicounter Machines and Complementation. Theor. Comput. Sci. 51: 325-330 (1987)
• 
  Fernando Orejas:
  A Characterization of Passing Compatibility for Parameterized Specifications. Theor. Comput. Sci. 51: 205-214 (1987)
• 
  Ian Parberry:
  On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes. Theor. Comput. Sci. 51: 239-247 (1987)
• 
  A. S. Troelstra:
  On the Syntax of Martin-Löf's Type Theories. Theor. Comput. Sci. 51: 1-26 (1987)
• 
  Jozef Vyskoc:
  An O(nlg k . 2n/2) Time and O(k . 2n/k) Space Algorithm for Certain NP-Complete Problems. Theor. Comput. Sci. 51: 221-227 (1987)
• 
  Klaus W. Wagner:
  More Complicated Questions About Maxima and Minima, and Some Closures of NP. Theor. Comput. Sci. 51: 53-80 (1987)
• 
  Susumu Yamasaki, Mikio Yoshida, Shuji Doshita:
  A Fixpoint Semantics of Horn Sentences Based on Substitution Sets. Theor. Comput. Sci. 51: 309-324 (1987)
• 
  Takashi Yokomori:
  On Purely Morphic Characterizations of Context-Free Languages. Theor. Comput. Sci. 51: 301-308 (1987)