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

• 1990
• 
  Marcella Anselmo:
  Two-Way Reading on Words. IMYCS 1990: 110-119
• 
  Bin Cong, Zevi Miller, Ivan Hal Sudborough:
  Optimum Simulation of Meshes by Small Hypercubes. IMYCS 1990: 30-46
• 
  Jean-Luc Coquidé, Rémi Gilleron:
  Proofs and Reachablity Problem for Ground Rewrite Systems. IMYCS 1990: 120-129
• 
  Karel Culík II, Simant Dube:
  Methods for Generating Deterministic Fractals and Image Compression. IMYCS 1990: 2-28
• 
  Carsten Damm:
  Problems Complete for +L. IMYCS 1990: 130-137
• 
  Marta Franová:
  Constructive Matching - Explanation Based Methodology for Inductive Theorem Proving. IMYCS 1990: 138-147
• 
  Andreas Goerdt, Helmut Seidl:
  Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. IMYCS 1990: 148-158
• 
  Dominik Gomm, Rolf Walter:
  The Distributed Termination Problem: Formal Solution and Correctness Based on Petri Nets. IMYCS 1990: 159-168
• 
  Yves Kodratoff:
  Seven Hard Problems in Symbolic Background Knowledge Acquisition. IMYCS 1990: 47-61
• 
  Martin Loebl:
  Greedy Compression Systems. IMYCS 1990: 169-176
• 
  Michael Mñuk:
  A Div(n) Depth Boolean Circuit for Smooth Modular Inverse. IMYCS 1990: 177-183
• 
  Martin Fodslette Møller:
  Learning by Conjugate Gradients. IMYCS 1990: 184-194
• 
  Maryse Pelletier:
  Monoids Described by Pushdown Automata. IMYCS 1990: 195-203
• 
  Peter Rajcáni:
  Optimal Parallel 3-Colouring Algorithm for Rooted Trees and Its Application. IMYCS 1990: 204-213
• 
  Klaus Reinhardt:
  Hierarchies over the Context-Free Languages. IMYCS 1990: 214-224
• 
  Christophe Reutenauer:
  Subsequential Functions: Characterizations, Minimization, Examples. IMYCS 1990: 62-79
• 
  Ildikó Sain:
  Past Proves More Invariance Properties but not PCA's. IMYCS 1990: 80-92
• 
  Lila Santean:
  A Hierarchy of Unary Primitive Recursive String-Functions. IMYCS 1990: 225-233
• 
  Patrice Séébold, Karine Slowinski:
  Minimizing Picture Words. IMYCS 1990: 234-243
• 
  Peter Skodný:
  Remarks on the Frequency-Coded Neural Nets Complexity. IMYCS 1990: 244-250
• 
  Ralf Stiebe:
  Picture Generation Using Matrix Systems. IMYCS 1990: 251-260
• 
  Christian B. Suttner:
  Representing Heuristic-Relevant Information for an Automated Theorem Prover. IMYCS 1990: 261-270
• 
  Kristel Unger:
  A New Method for Proving Lower Bounds in the Model of Algebraic Decision Trees. IMYCS 1990: 271-277
• 
  Juraj Waczulík:
  Area Time Squared and Area Complexity of VLSI Computations is Strongly Unclosed Under Union and Intersection. IMYCS 1990: 278-287
• 
  Igor Walukiewicz:
  Decision Procedure for Checking Validity of PAL Formulas. IMYCS 1990: 288-298
• 
  Juraj Wiedermann:
  Complexity Issues in Discrete Neurocomputing. IMYCS 1990: 93-108
• 
  Jürgen Dassow, Jozef Kelemen:
  Aspects and Prospects of Theoretical Computer Science, 6th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 19-23, 1990, Proceedings. Lecture Notes in Computer Science 464, Springer 1990, ISBN 3-540-53414-8 [contents]