• 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

• 1975
• 
  Robert M. Baer:
  Computation by Assembly. J. Comput. Syst. Sci. 11(3): 285-294 (1975)
• 
  J. W. de Bakker, Lambert G. L. T. Meertens:
  On the Completeness of the Inductive Assertion Method. J. Comput. Syst. Sci. 11(3): 323-357 (1975)
• 
  Michael J. Best, Klaus Ritter:
  An Accelerated Conjugate Direction Method to Solve Linearly Constrained Minimization Problems. J. Comput. Syst. Sci. 11(3): 295-322 (1975)
• 
  Armin B. Cremers, Seymour Ginsburg:
  Context-Free Grammar Forms. J. Comput. Syst. Sci. 11(1): 86-117 (1975)
• 
  Andrzej Ehrenfeucht:
  Practical Decidability. J. Comput. Syst. Sci. 11(3): 392-396 (1975)
• 
  Hartmut Ehrig, Karl Wilhelm Tischer:
  Graph Grammars and Applications to Specialization and Evolution in Biology. J. Comput. Syst. Sci. 11(2): 212-236 (1975)
• 
  Allen R. Freedman, Richard E. Ladner:
  Space Bounds for Processing Contentless Inputs. J. Comput. Syst. Sci. 11(1): 118-128 (1975)
• 
  Salvatore Di Gregorio, Giuseppe Trautteur:
  On Reversibility in Cellular Automata. J. Comput. Syst. Sci. 11(3): 382-391 (1975)
• 
  Masateru Harao, Shoichi Noguchi:
  Fault Tolerant Cellular Automata. J. Comput. Syst. Sci. 11(2): 171-185 (1975)
• 
  W. O. Höllerer, Roland Vollmar:
  On "Forgetful" Cellular Automata. J. Comput. Syst. Sci. 11(2): 237-251 (1975)
• 
  Oscar H. Ibarra, Sartaj Sahni:
  Hierarchies of Turing Machines with Restricted Tape Alphabet Size. J. Comput. Syst. Sci. 11(1): 56-67 (1975)
• 
  Yoshihide Igarashi, Namio Honda:
  Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages. J. Comput. Syst. Sci. 11(3): 397 (1975)
• 
  Neil D. Jones:
  Space-Bounded Reducibility among Combinatorial Problems. J. Comput. Syst. Sci. 11(1): 68-85 (1975)
• 
  Jan van Leeuwen:
  The Tape-Complexity of Context-Independent Developmental Languages. J. Comput. Syst. Sci. 11(2): 203-211 (1975)
• 
  Hidenosuke Nishio, Youichi Kobuchi:
  Fault Tolerant Cellular Spaces. J. Comput. Syst. Sci. 11(2): 150-170 (1975)
• 
  Václav Rajlich:
  Dynamics of Discrete Systems and Pattern Reproductions. J. Comput. Syst. Sci. 11(2): 186-202 (1975)
• 
  Ann Reedy, Walter J. Savitch:
  Ambiguity in the Developmental Systems of Lindenmayer. J. Comput. Syst. Sci. 11(2): 262-283 (1975)
• 
  Barry K. Rosen:
  Program Equivalence and Context-Free Grammars. J. Comput. Syst. Sci. 11(3): 358-374 (1975)
• 
  Branislav Rovan:
  Proving Containment of Bounded AFL. J. Comput. Syst. Sci. 11(1): 1-55 (1975)
• 
  Grzegorz Rozenberg, K. P. Lee:
  Some Properties of the Class of L Languages with Interactions. J. Comput. Syst. Sci. 11(1): 129-147 (1975)
• 
  Eduardo D. Sontag:
  On Some Questions of Rationality and Decidability. J. Comput. Syst. Sci. 11(3): 375-381 (1975)
• 
  Adrian Walker:
  Formal Grammars and the Regeneration Capability of Biological Systems. J. Comput. Syst. Sci. 11(2): 252-261 (1975)