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

• 1995
• 
  Noga Alon, Sridhar Rajagopalan, Subhash Suri:
  Long Non-Crossing Configurations in the Plane. Fundam. Informaticae 22(4): 385-394 (1995)
• 
  Andrea Asperti:
  Linear Logic, Comonads and Optimal Reduction. Fundam. Informaticae 22(1/2): 3-22 (1995)
• 
  Marshall W. Bern:
  Compatible Tetrahedralizations. Fundam. Informaticae 22(4): 371-384 (1995)
• 
  Jürgen Dassow, Gheorghe Paun, Sorina Vicolov:
  On the Generative Capacity of Certain Classes of Cooperating Grammar Systems. Fundam. Informaticae 22(3): 217-226 (1995)
• 
  Pierpaolo Degano, Leonarda Raffoni:
  Fairness and Priority. Fundam. Informaticae 22(3): 299-306 (1995)
• 
  Jürgen Dix:
  A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties. Fundam. Informaticae 22(3): 227-255 (1995)
• 
  Jürgen Dix:
  A Classification Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundam. Informaticae 22(3): 257-288 (1995)
• 
  David Eppstein, Gary L. Miller, Shang-Hua Teng:
  A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. Fundam. Informaticae 22(4): 309-329 (1995)
• 
  Karl Heinz Hofmann, Michael W. Mislove:
  All Compact Hausdorff Lambda Models are Degenerate. Fundam. Informaticae 22(1/2): 23-52 (1995)
• 
  Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma:
  Convex Distance Functions in 3-Space are Different. Fundam. Informaticae 22(4): 331-352 (1995)
• 
  David G. Kirkpatrick, Jack Snoeyink:
  Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation. Fundam. Informaticae 22(4): 353-370 (1995)
• 
  Roman M. Kolpakov:
  On the Complexity of Generation of Rational Numbers by Boolean Functions. Fundam. Informaticae 22(3): 289-298 (1995)
• 
  Joachim Lambek:
  Cut Elimination for Classical Bilinear Logic. Fundam. Informaticae 22(1/2): 53-67 (1995)
• 
  Giuseppe Longo:
  Parametric and Type-Dependent Polymorphism. Fundam. Informaticae 22(1/2): 69-92 (1995)
• 
  Michael W. Mislove, Frank J. Oles:
  Adjunctions Between Categories of Domains. Fundam. Informaticae 22(1/2): 93-116 (1995)
• 
  Eugenio Moggi:
  A Semantics for Evaluation Logic. Fundam. Informaticae 22(1/2): 117-152 (1995)
• 
  Mikhail Moshkov:
  About the Depth of Decision Trees Computing Boolean Functions. Fundam. Informaticae 22(3): 203-215 (1995)
• 
  György E. Révész:
  Categorical Combinations with Explicit Products. Fundam. Informaticae 22(1/2): 153-166 (1995)
• 
  Eugene W. Stark:
  An Algebra of Dataflow Networks. Fundam. Informaticae 22(1/2): 167-185 (1995)
• 
  Eric G. Wagner, Wafaa Khalil, Robert F. C. Walters:
  Fix-point Semantics for Programs in Distributive Categories. Fundam. Informaticae 22(1/2): 187-202 (1995)