• 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

• 1995
• 
  Naoki Abe:
  Characterizing PAC-Learnability of Semilinear Sets. Inf. Comput. 116(1): 81-102 (1995)
• 
  Roberto M. Amadio:
  A Quick Construction of a Retraction of All Retractions for Stable Bifinites. Inf. Comput. 116(2): 272-274 (1995)
• 
  Juanito Camilleri, Glynn Winskel:
  CCS with Priority Choice. Inf. Comput. 116(1): 26-37 (1995)
• 
  John Case, Sanjay Jain, Arun Sharma:
  Complexity Issues for Vacillatory Function Identification. Inf. Comput. 116(2): 174-192 (1995)
• 
  Bruno Courcelle:
  Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement. Inf. Comput. 116(2): 275-293 (1995)
• 
  Volker Diekert, Paul Gastin, Antoine Petit:
  Rational and Recognizable Complex Trace Languages. Inf. Comput. 116(1): 134-153 (1995)
• 
  Wayne Eberly:
  Fast Parallel Band Matrix Arithmetic. Inf. Comput. 116(1): 117-127 (1995)
• 
  Shu-Cherng Fang, J. R. Rajasekera:
  Entropy Optimization Models with Convex Constraints. Inf. Comput. 116(2): 304-311 (1995)
• 
  Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn:
  A Communication-Randomness Tradeoff for Two-Processor Systems. Inf. Comput. 116(2): 155-161 (1995)
• 
  Zoltán Fülöp, Sándor Vágvölgyi:
  Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations. Inf. Comput. 116(2): 231-240 (1995)
• 
  Gösta Grahne, Alberto O. Mendelzon:
  Updates and Subjunctive Queries. Inf. Comput. 116(2): 241-252 (1995)
• 
  Michael Huth:
  A Maximal Monoidal Closed Category of Distributive Algebraic Domains. Inf. Comput. 116(1): 10-25 (1995)
• 
  Neil Immerman, Susan Landau:
  The Complexity of Iterated Multiplication. Inf. Comput. 116(1): 103-116 (1995)
• 
  Anil Nerode, Raymond T. Ng, V. S. Subrahmanian:
  Computing Circumscriptive Databases: I. Theory and Algorithms. Inf. Comput. 116(1): 58-80 (1995)
• 
  Jon G. Riecke:
  Statman's 1-Section Theorem. Inf. Comput. 116(2): 294-303 (1995)
• 
  Steve A. Schneider:
  An Operational Semantics for Timed CSP. Inf. Comput. 116(2): 193-213 (1995)
• 
  Dafna Sheinwald, Abraham Lempel, Jacob Ziv:
  On Encoding and Decoding with Two-Way Head Machines. Inf. Comput. 116(1): 128-133 (1995)
• 
  Michiel H. M. Smid:
  Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem. Inf. Comput. 116(1): 1-9 (1995)
• 
  Ulrich Tamm:
  Communication Complexity of Sum-Type Functions Invariant under Translation. Inf. Comput. 116(2): 162-173 (1995)
• 
  Bent Thomsen:
  A Theory of Higher Order Communicating Systems. Inf. Comput. 116(1): 38-57 (1995)
• 
  David Walker:
  Objects in the pi-Calculus. Inf. Comput. 116(2): 253-271 (1995)
• 
  Tomoyuki Yamakami:
  Feasible Computability and Resource Bounded Topology. Inf. Comput. 116(2): 214-230 (1995)