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

• 1981
• 
  Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi:
  Full Approximatibility of a Class of Problems over Power Sets. CAAP 1981: 76-87
• 
  Jürgen Avenhaus, Klaus Madlener:
  How to Compute Generators for the Intersection of Subgroups in Free Groups. CAAP 1981: 88-100
• 
  Marc Bergman, Pierre Deransart:
  Abstract Data Types and Rewriting Systems: Application to the Programming of Algebraic Abstract Data Types in Prolog. CAAP 1981: 101-116
• 
  J. Bilstein, Werner Damm:
  Top-Down Tree-Transducers for Infinite Trees I. CAAP 1981: 117-134
• 
  Stephen L. Bloom, David B. Patterson:
  Easy Solutions are Hard To Find. CAAP 1981: 135-146
• 
  Gérard Boudol:
  Une Semantique Pour Les Arbres Non Deterministes. CAAP 1981: 147-161
• 
  Manfred Broy, Martin Wirsing:
  On the Algebraic Specification of Nondeterministic Programming Languages. CAAP 1981: 162-179
• 
  Nachum Dershowitz, Shmuel Zaks:
  Applied Tree Enumerations. CAAP 1981: 180-193
• 
  Hartmut Ehrig:
  Algebraic Theory of Parameterized Specifications with Requirements. CAAP 1981: 1-24
• 
  Marie-Pierre Franchi-Zannettacci:
  Evaluation d'Arbre Pour un Calcul Formel (Application a l'Enumeration de Proteines). CAAP 1981: 194-210
• 
  Irène Guessarian:
  On Pushdown Tree Automata. CAAP 1981: 211-223
• 
  Günter Hornung, Peter Raulefs:
  Initial and Terminal Algebra Semantics of Parameterized Abstract Data Type Specifications With Inequalities. CAAP 1981: 224-237
• 
  Gérard Jacob:
  Calcul du Rang des sum-Arbres Infinis Reguliers. CAAP 1981: 238-254
• 
  Marek J. Lao:
  A Class of Tree-Like UNION-FIND Data Structures and the Nonlinearity. CAAP 1981: 255-267
• 
  Bernard Leguy:
  Grammars Without Erasing Rules - The OI Case. CAAP 1981: 268-279
• 
  Eric Lilin:
  Proprietes de Cloture d'une Extension de Transducteurs d'Arbres Deterministes. CAAP 1981: 280-289
• 
  Andrzej Lingas:
  Certain Algorithms for Subgraph Isomorphism Problems. CAAP 1981: 290-307
• 
  Giancarlo Mauri, Nicoletta Sabadini:
  A # P-Complete Problem over Arithmetical Trees. CAAP 1981: 308-315
• 
  Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi:
  Trees in Kripke Models and in an Intuitionistic Refutation System. CAAP 1981: 316-331
• 
  Robin Milner:
  A Modal Characterisation of Observable Machine-Behaviour. CAAP 1981: 25-34
• 
  Jürg Nievergelt:
  Trees as Data and File Structures. CAAP 1981: 35-45
• 
  Maurice Nivat:
  Infinitary Relations. CAAP 1981: 46-75
• 
  Yehoshua Perl, Yossi Shiloach:
  Efficient Optimization of Monotonic Functions on Trees. CAAP 1981: 332-339
• 
  N. Polian:
  Differents Types de Derivations Infinites Dans les Grammaires Algebriques d'Arbres. CAAP 1981: 340-349
• 
  Simona Ronchi Della Rocca:
  Discriminability of Infinite Sets of Terms in the D_infinity-Models of the lambda-calculus. CAAP 1981: 350-364
• 
  Egidio Astesiano, Corrado Böhm:
  CAAP '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings. Lecture Notes in Computer Science 112, Springer 1981, ISBN 3-540-10828-9 [contents]