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

• 1968
• 
  Dennis Allen Jr.:
  On a Characterization of the Nonregular Set of Primes. J. Comput. Syst. Sci. 2(4): 464-467 (1968)
• 
  Ronald Alter:
  On the Nonexistence of Close-Packed Double Hamming-Error-Correcting Codes on q=7 Symbols. J. Comput. Syst. Sci. 2(2): 169-176 (1968)
• 
  H. A. Antosiewicz:
  Newton's Method and Boundary Value Problems. J. Comput. Syst. Sci. 2(2): 177-202 (1968)
• 
  A. V. Balakrishnan:
  A New Computing Technique in System Identification. J. Comput. Syst. Sci. 2(1): 102-116 (1968)
• 
  Austin Blaquière, Françoise Gérard:
  On the Geometry of Optimal Strategies in Two-Person Games of Kind. J. Comput. Syst. Sci. 2(3): 288-304 (1968)
• 
  Lothar Collatz:
  Multiparametric Eigenvalue Problems in Inner-product Spaces. J. Comput. Syst. Sci. 2(4): 333-341 (1968)
• 
  Roy Danchick:
  Further Results on Generalized Predictor-Corrector Methods. J. Comput. Syst. Sci. 2(2): 203-218 (1968)
• 
  Vladimir F. Demjanov:
  Algorithms for Some Minimax Problems. J. Comput. Syst. Sci. 2(4): 342-380 (1968)
• 
  J. R. H. Dempster:
  On the Multiplying Ability of Two-Way Automata. J. Comput. Syst. Sci. 2(4): 420-426 (1968)
• 
  Patrick C. Fischer:
  The Reduction of Tape Reversals for Off-Line One-Tape Turing Machines. J. Comput. Syst. Sci. 2(2): 136-147 (1968)
• 
  Patrick C. Fischer, Arnold L. Rosenberg:
  Multitape One-Way Nonwriting Automata. J. Comput. Syst. Sci. 2(1): 88-101 (1968)
• 
  Hervé Gallaire, Jim Gray, Michael A. Harrison, Gabor T. Herman:
  Infinite Linear Sequential Machines. J. Comput. Syst. Sci. 2(4): 381-419 (1968)
• 
  Seymour Ginsburg, Edwin H. Spanier:
  Derivation-Bounded Languages. J. Comput. Syst. Sci. 2(3): 228-250 (1968)
• 
  Juris Hartmanis:
  Tape-Reversal Bounded Turing Machine Computations. J. Comput. Syst. Sci. 2(2): 117-135 (1968)
• 
  John E. Hopcroft, Jeffrey D. Ullman:
  Deterministic Stack Automata and the Quotient Operator. J. Comput. Syst. Sci. 2(1): 1-12 (1968)
• 
  Izumi Kimura:
  Extensions of Asynchronous Circuits and the Delay Problem. I: Good Extensions and the Delay Problem of the First Kind. J. Comput. Syst. Sci. 2(3): 251-287 (1968)
• 
  David E. Muller, Gianfranco R. Putzolu:
  Frequency of Decomposability among Machines with a Large Number of States. J. Comput. Syst. Sci. 2(3): 219-227 (1968)
• 
  Marvin C. Paull, Stephen H. Unger:
  Structural Equivalence of Context-Free Grammars. J. Comput. Syst. Sci. 2(4): 427-463 (1968)
• 
  Gianfranco R. Putzolu:
  Probabilistic Aspects of Machine Decomposition Theory. J. Comput. Syst. Sci. 2(3): 312-331 (1968)
• 
  Gene F. Rose:
  Closures which Preserve Finiteness in Families of Languages. J. Comput. Syst. Sci. 2(2): 148-168 (1968)
• 
  Alan Schumitzky:
  On the Equivalence between Matrix Riccati Equations and Fredholm Resolvents. J. Comput. Syst. Sci. 2(1): 76-87 (1968)
• 
  Eric G. Wagner:
  Bounded Action Machines: Toward an Abstract Theory of Computer Structure. J. Comput. Syst. Sci. 2(1): 13-75 (1968)
• 
  Roger J.-B. Wets, David W. Walkup:
  A Note on Decision Rules for Stochastic Programs. J. Comput. Syst. Sci. 2(3): 305-311 (1968)