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

• 1990
• 
  Marco Bellia, Michele Bugliesi, M. Eugenia Occhiuto:
  Combinatory Forms for Equational Programming: Instances, Unification and Narrowing. CAAP 1990: 42-56
• 
  Gérard Boudol, Kim Guldstrand Larsen:
  Graphical versus Logical Specifications. CAAP 1990: 57-71
• 
  Jiazhen Cai, Robert Paige, Robert Endre Tarjan:
  More Efficient Bottom-Up Tree Pattern Matching. CAAP 1990: 72-86
• 
  Didier Caucal:
  On the Regular Structure of Prefix Rewriting. CAAP 1990: 87-102
• 
  Edmund M. Clarke, Anca Browne, Robert P. Kurshan:
  A Unified Approach For Showing Language Containment And Equivalence Between Various Types Of Omega-Automata. CAAP 1990: 103-116
• 
  Maxime Crochemore, Jean Néraud:
  Unitary Monoid with Two Generators: An Algorithmic Point of View. CAAP 1990: 117-131
• 
  Pierre-Louis Curien, Giorgio Ghelli:
  Coherence of Subsumption. CAAP 1990: 132-146
• 
  Uffe Engberg, Glynn Winskel:
  Petri Nets as Models of Linear Logic. CAAP 1990: 147-161
• 
  Gian-Luigi Ferrari, Ugo Montanari:
  Towards the Unification of Models for Concurrency. CAAP 1990: 162-176
• 
  Dominique Geniet, René Schott, Loÿs Thimonier:
  A Markovian Concurrency Measure. CAAP 1990: 177-190
• 
  Tirza Hirst, David Harel:
  On the Power of Bounded Concurrency II: The Pushdown Automata Level. CAAP 1990: 1-17
• 
  Kristoffer Høgsbro Holm:
  Graph Matching in Operational Semantics and Typing. CAAP 1990: 191-205
• 
  A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
  ML Typability is DEXTIME-Complete. CAAP 1990: 206-220
• 
  Emmanuel Kounalis:
  Testing for Inductive (Co)-Reducibility. CAAP 1990: 221-238
• 
  Guy Louchard, René Schott:
  Probabilistic Analysis of Some Distributed Algorithms. CAAP 1990: 239-253
• 
  Michael I. Schwartzbach:
  Infinite Values in Hierarchical Imperative Types. CAAP 1990: 254-268
• 
  Helmut Seidl:
  Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. CAAP 1990: 269-284
• 
  Xavier Gérard Viennot:
  Trees Everywhere. CAAP 1990: 18-41
• 
  André Arnold:
  CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings. Lecture Notes in Computer Science 431, Springer 1990, ISBN 3-540-52590-4 [contents]