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

• 1992
• 
  David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien:
  Regular Languages in NC¹. J. Comput. Syst. Sci. 44(3): 478-499 (1992)
• 
  Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby:
  On the Theory of Average Case Complexity. J. Comput. Syst. Sci. 44(2): 193-219 (1992)
• 
  Edward P. F. Chan, Paolo Atzeni:
  Connection-Trap-Free Database Schemes. J. Comput. Syst. Sci. 44(1): 1-22 (1992)
• 
  Elias Dahlhaus, Marek Karpinski:
  Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem. J. Comput. Syst. Sci. 44(1): 94-102 (1992)
• 
  Razvan Diaconescu:
  Contraction Algebras and Unification of (Infinite) Terms. J. Comput. Syst. Sci. 44(1): 23-42 (1992)
• 
  Uriel Feige, Adi Shamir:
  Multi-Oracle Interactive Protocols with Constant Space Verifiers. J. Comput. Syst. Sci. 44(2): 259-271 (1992)
• 
  Thomas Herbst:
  Some Remarks on a Theorem of Sakarovitch. J. Comput. Syst. Sci. 44(1): 160-165 (1992)
• 
  Steven Homer, Alan L. Selman:
  Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. J. Comput. Syst. Sci. 44(2): 287-301 (1992)
• 
  Michael Kaminski, Shlomit S. Pinter:
  Finite Automata on Directed Graphs. J. Comput. Syst. Sci. 44(3): 425-446 (1992)
• 
  Andrew Klapper:
  Distributed Event Algebras. J. Comput. Syst. Sci. 44(3): 411-424 (1992)
• 
  Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán:
  Turing Machines with Few Accepting Computations and Low Sets for PP. J. Comput. Syst. Sci. 44(2): 272-286 (1992)
• 
  Tak Wah Lam, Walter L. Ruzzo:
  Results on Communication Complexity Classes. J. Comput. Syst. Sci. 44(2): 324-342 (1992)
• 
  Thomas Lengauer, Klaus W. Wagner:
  The Correlation between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. J. Comput. Syst. Sci. 44(1): 63-93 (1992)
• 
  Ming Li, Paul M. B. Vitányi:
  Inductive Reasoning and Kolmogorov Complexity. J. Comput. Syst. Sci. 44(2): 343-384 (1992)
• 
  Steven Lindell:
  The Invariant Problem for Binary String Structures and the Parallel Complexity Theory of Queries. J. Comput. Syst. Sci. 44(3): 385-410 (1992)
• 
  Jack H. Lutz:
  Almost Everywhere High Nonuniform Complexity. J. Comput. Syst. Sci. 44(2): 220-258 (1992)
• 
  Wolfgang Maass, Theodore A. Slaman:
  The Complexity Types of Computable Sets. J. Comput. Syst. Sci. 44(2): 168-192 (1992)
• 
  Ernst W. Mayr, Ashok Subramanian:
  The Complexity of Circuit Value and Network Stability. J. Comput. Syst. Sci. 44(2): 302-323 (1992)
• 
  David E. Muller, Franco P. Preparata:
  Parallel Restructuring and Evaluation of Expressions. J. Comput. Syst. Sci. 44(1): 43-62 (1992)
• 
  Prabhakar Ragde:
  Processor-Time Tradeoffs in PRAM Simulations. J. Comput. Syst. Sci. 44(1): 103-113 (1992)
• 
  Ravi S. Sandhu:
  Undecidability of Safety for the Schematic Protection Model with Cyclic Creates. J. Comput. Syst. Sci. 44(1): 141-159 (1992)
• 
  Manuel Silva, Tadao Murata:
  B-Fairness and Structural B-Fairness in Petri Net Models of Concurrent Systems. J. Comput. Syst. Sci. 44(3): 447-477 (1992)
• 
  Satoshi Takahashi:
  Self-Similarity of Linear Cellular Automata. J. Comput. Syst. Sci. 44(1): 114-140 (1992)
• 
  Osamu Watanabe:
  On Polynomial Time One-Truth-Table Reducibility to a Sparse Set. J. Comput. Syst. Sci. 44(3): 500-516 (1992)