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

• 1986
• 
  Andrea Asperti, Giuseppe Longo:
  Relating Type-Structures: Partial Variations on a Theme of Friedman and Statman. CAAP 1986: 266-287
• 
  Michel Bauderon, Bruno Courcelle:
  An Algebraic Formalism for Graphs. CAAP 1986: 74-84
• 
  Joffroy Beauquier, Béatrice Bérard:
  On the Equivalence of Synchronization Sets. CAAP 1986: 17-29
• 
  Rafael Casas, Jean-Marc Steyaert:
  Bottom-Up Recursion in Trees. CAAP 1986: 172-182
• 
  Robert Cori, Serge Dulucq:
  Colourings of Planar Maps and the Equality of Two Languages. CAAP 1986: 6-16
• 
  Elias Dahlhaus, Johann A. Makowsky:
  Computable Directory Queries. CAAP 1986: 254-265
• 
  Elias Dahlhaus, Manfred K. Warmuth:
  Membership for Growing Context Sensitive Grammars is Polynomial. CAAP 1986: 85-99
• 
  Philippe Devienne, Patrick Lebègue:
  Weighted Graphs: A Tool for Logic Programming. CAAP 1986: 100-111
• 
  David de Frutos-Escrig:
  Probabilistic Ianov's Schemes. CAAP 1986: 142-157
• 
  Gilberto Filé:
  Classical and Incremental Evaluators for Attribute Grammars. CAAP 1986: 112-126
• 
  Philippe Jacquet, Mireille Régnier:
  Trie Partitioning Process: Limiting Distributions. CAAP 1986: 196-210
• 
  Guy Louchard:
  Random Walks, Gaussian Processes, and List Structures. CAAP 1986: 211-224
• 
  Grazyna Mirkowska, Andrzej Salwicki:
  On Applications of Algorithmic Logic. CAAP 1986: 288-306
• 
  Francesco Parisi-Presicce:
  Inner and Mutual Compatibility of Basic Operations on Module Specifications. CAAP 1986: 30-44
• 
  Alex Pelin, Jean H. Gallier:
  Exact Computation Sequences. CAAP 1986: 45-59
• 
  Alberto Pettorossi:
  Transformation Strategies for Deriving On Line Programs. CAAP 1986: 127-141
• 
  Ran Rinat, Nissim Francez, Orna Grumberg:
  Infinite Trees, Markings and Well Foundedness. CAAP 1986: 238-253
• 
  Kai Salomaa:
  Alternating Bottom-Up Tree Recognisers. CAAP 1986: 158-171
• 
  René Schott:
  Random Walks on Trees. CAAP 1986: 225-237
• 
  Gheorghe Stefanescu:
  An Algebraic Theory of Flowchart Schemes. CAAP 1986: 60-73
• 
  Heiko Vogler:
  Basic Tree Transducers. CAAP 1986: 183-195
• 
  Eric G. Wagner:
  A Categorical Treatment of Pre- and Post Conditions. CAAP 1986: 1-5
• 
  Paul Franchi-Zannettacci:
  CAAP '86, 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986, Proceedings. Lecture Notes in Computer Science 214, Springer 1986, ISBN 3-540-16443-X [contents]