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

• 1971
• 
  Oliver Aberth:
  The Concect of Effective Method Applied to Computational Problems of Linear Algebra. J. Comput. Syst. Sci. 5(1): 17-25 (1971)
• 
  Serafino Amoroso, Gerald Cooper:
  Tessellation Structures for Reproduction of Arbitrary Patterns. J. Comput. Syst. Sci. 5(5): 455-464 (1971)
• 
  Giorgio Ausiello:
  Abstract Computational Complexity and Cycling Computations. J. Comput. Syst. Sci. 5(2): 118-128 (1971)
• 
  A. V. Balakrishnan:
  A Computational Approach to the Maximum Principle. J. Comput. Syst. Sci. 5(2): 163-191 (1971)
• 
  Ronald V. Book:
  Time-Bounded Grammars and Their Languages. J. Comput. Syst. Sci. 5(4): 397-429 (1971)
• 
  Janusz A. Brzozowski, Karel Culík II, Armen Gabrielian:
  Classification of Noncounting Events. J. Comput. Syst. Sci. 5(1): 41-53 (1971)
• 
  Jack W. Carlyle, Azaria Paz:
  Realizations by Stochastic Finite Automata. J. Comput. Syst. Sci. 5(1): 26-40 (1971)
• 
  Rina S. Cohen, Janusz A. Brzozowski:
  Dot-Depth of Star-Free Events. J. Comput. Syst. Sci. 5(1): 1-16 (1971)
• 
  Frederic G. Commoner, Anatol W. Holt, Shimon Even, Amir Pnueli:
  Marked Directed Graphs. J. Comput. Syst. Sci. 5(5): 511-523 (1971)
• 
  Robert L. Constable:
  Subrecursive Programming Languages. II. On Program Size. J. Comput. Syst. Sci. 5(3): 315-334 (1971)
• 
  Karel Culík II:
  Abstract Families of Relations. J. Comput. Syst. Sci. 5(6): 596-606 (1971)
• 
  John Doner:
  Erratum: Tree Acceptors and Some of Their Applications. J. Comput. Syst. Sci. 5(4): 453 (1971)
• 
  Erwin Engeler:
  Algorithmic Approximations. J. Comput. Syst. Sci. 5(1): 67-82 (1971)
• 
  Trevor I. Fenner, George Loizou:
  On Fully Indecomposable Matrices. J. Comput. Syst. Sci. 5(6): 607-622 (1971)
• 
  Arthur C. Fleck:
  Towards a Theory of Data Structures. J. Comput. Syst. Sci. 5(5): 475-488 (1971)
• 
  Seymour Ginsburg, Edwin H. Spanier:
  AFL with the Semilinear Property. J. Comput. Syst. Sci. 5(4): 365-396 (1971)
• 
  Allen A. Goldstein, F. C. Johnson, Jürgen Spiess:
  On the Isolation of the Roots of a Non-Linear Operator. J. Comput. Syst. Sci. 5(2): 83-87 (1971)
• 
  Jozef Gruska:
  A Characterization of Context-free Languages. J. Comput. Syst. Sci. 5(4): 353-364 (1971)
• 
  Jerzy W. Grzymala-Busse:
  Operation-Preserving Functions and Autononous Factors of Finite Automata. J. Comput. Syst. Sci. 5(5): 465-474 (1971)
• 
  Juris Hartmanis, Forbes D. Lewis:
  The use of Lists in the Study of Undecidable Problems in Automata Theory. J. Comput. Syst. Sci. 5(1): 54-66 (1971)
• 
  Gabor T. Herman:
  Every Finite Sequential Machine is Linearly Realizable. J. Comput. Syst. Sci. 5(5): 489-510 (1971)
• 
  Oscar H. Ibarra:
  Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata. J. Comput. Syst. Sci. 5(2): 88-117 (1971)
• 
  Izumi Kimura:
  Extensions of Asynchronous Circuits and the Delay Problem. Part II: Spike-Free Extensions and the Delay Problem of the Second Kind. J. Comput. Syst. Sci. 5(2): 129-162 (1971)
• 
  Forbes D. Lewis:
  The Enumerability and Invariance of Complexity Classes. J. Comput. Syst. Sci. 5(3): 286-303 (1971)
• 
  Zohar Manna:
  Mathematical Theory of Partial Correctness. J. Comput. Syst. Sci. 5(3): 239-253 (1971)
• 
  I. P. McWhirter:
  Substitution Expressions. J. Comput. Syst. Sci. 5(6): 629-637 (1971)
• 
  Peter J. Nicholson:
  Algebraic Theory of Finite Fourier Transforms. J. Comput. Syst. Sci. 5(5): 524-547 (1971)
• 
  Thomas J. Ostrand:
  Pattern Reproduction in Tessellation Automata of Arbitrary Dimension. J. Comput. Syst. Sci. 5(6): 623-628 (1971)
• 
  Terrence W. Pratt:
  Pair Grammars, Graph Languages and String-to-Graph Translations. J. Comput. Syst. Sci. 5(6): 560-595 (1971)
• 
  György E. Révész:
  Unilateral Context Sensitive Grammars and Left-to-Right Parsing. J. Comput. Syst. Sci. 5(4): 337-352 (1971)

skipping 5 more matches