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

• 1985
• 
  Takao Asano:
  An Approach to the Subgraph Homeomorphism Problem. Theor. Comput. Sci. 38: 249-267 (1985)
• 
  Catriel Beeri, Moshe Y. Vardi:
  Formal Systems for Join Dependencies. Theor. Comput. Sci. 38: 99-116 (1985)
• 
  Hans-Dieter Burkhard:
  An Investigation of Controls for Concurrent Systems Based on Abstract Control Languages. Theor. Comput. Sci. 38: 193-222 (1985)
• 
  Alain Finkel:
  Une Généralisation des Théorème de Higman et de Simon aux Mots Infinis. Theor. Comput. Sci. 38: 137-142 (1985)
• 
  Marie-Paule Flé, Gérard Roucairol:
  Maximal Serializability of Iterated Transactions. Theor. Comput. Sci. 38: 1-16 (1985)
• 
  Teofilo F. Gonzalez:
  Clustering to Minimize the Maximum Intercluster Distance. Theor. Comput. Sci. 38: 293-306 (1985)
• 
  David Harel, David Peleg:
  Process Logic with Regular Formulas. Theor. Comput. Sci. 38: 307-322 (1985)
• 
  Masatosi Imori, Hisao Yamada:
  Periodic Character Sequences where Identifying two Characters Strictly Reduces the Period. Theor. Comput. Sci. 38: 167-192 (1985)
• 
  Matthias Jantzen:
  Extending Regular Expressions with Iterated Shuffle. Theor. Comput. Sci. 38: 223-247 (1985)
• 
  Christoph Kreitz, Klaus Weihrauch:
  Theory of Representations. Theor. Comput. Sci. 38: 35-53 (1985)
• 
  Michel Leconte:
  A Characterization of Power-Free Morphisms. Theor. Comput. Sci. 38: 117-122 (1985)
• 
  Ernst L. Leiss:
  Succinct Representation of Regular Languages by Boolean Automata II. Theor. Comput. Sci. 38: 133-136 (1985)
• 
  Nathan Linial, Michael Tarsi:
  Deciding Hypergraph 2-Colourability by H-Resolution. Theor. Comput. Sci. 38: 343-347 (1985)
• 
  Bhubaneswaru Mishra, Edmund M. Clarke:
  Hierarchical Verification of Asynchronous Circuits Using Temporal Logic. Theor. Comput. Sci. 38: 269-291 (1985)
• 
  Prakash V. Ramanan, C. L. Liu:
  Permutation Representation of k-Ary Trees. Theor. Comput. Sci. 38: 83-98 (1985)
• 
  Daniel J. Rosenkrantz, Harry B. Hunt III:
  Testing for Grammatical Coverings. Theor. Comput. Sci. 38: 323-341 (1985)
• 
  Diana Schmidt:
  The Recursion-Theoretic Structure of Complexity Classes. Theor. Comput. Sci. 38: 143-156 (1985)
• 
  Marc Snir:
  Lower Bounds on Probabilistic Linear Decision Trees. Theor. Comput. Sci. 38: 69-82 (1985)
• 
  Do Long Van:
  Ensembles Code-Compatibles et une Généralisation du Théorème de Sardinas-Patterson. Theor. Comput. Sci. 38: 123-132 (1985)
• 
  Osamu Watanabe:
  On One-One Polynomial Time Equivalence Relations. Theor. Comput. Sci. 38: 157-165 (1985)
• 
  Ingo Wegener:
  On the Complexity of Slice Functions. Theor. Comput. Sci. 38: 55-68 (1985)
• 
  Klaus Weihrauch:
  Type 2 Recursion Theory. Theor. Comput. Sci. 38: 17-33 (1985)