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

• 1988
• 
  Giorgio Ausiello:
  Directed Hypergraphs: Data Structures and Applications. CAAP 1988: 295-303
• 
  Jochen Burghardt:
  A Tree Pattern Matching Algorithm with Reasonable Space Requirements. CAAP 1988: 1-15
• 
  Rachid Echahed:
  On Comleteness of Narrowing Strategies. CAAP 1988: 89-101
• 
  Jean Françon, B. Randrianarimanana, René Schott:
  Analysis of Dynamic Algorithms in D. E. Knuth's Model. CAAP 1988: 72-88
• 
  Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner:
  Equational Completion in Order-Sorted Algebras (Extended Abstract). CAAP 1988: 165-184
• 
  Roberto Gorrieri, Sergio Marchetti, Ugo Montanari:
  A²CCS: A Simple Extension of CCS for Handling Atomic Actions. CAAP 1988: 258-270
• 
  E. Pascal Gribomont:
  Proving Systolic Arrays. CAAP 1988: 185-199
• 
  Zdzislaw Habasinski:
  Regular Automata and Model Checking. CAAP 1988: 231-243
• 
  Cornelis Huizing, Rob Gerth, Willem P. de Roever:
  Modeling Statecharts Behaviour in a Fully Abstract Way. CAAP 1988: 271-294
• 
  Richard Kennaway:
  Implementing Term Rewritin Languages in Dactl. CAAP 1988: 102-116
• 
  Rolf Klein, Derick Wood:
  On the Maximum Path Length of AVL Trees. CAAP 1988: 16-27
• 
  Johannes Köbler, Uwe Schöning, Jacobo Torán:
  On Counting and Approximation. CAAP 1988: 40-51
• 
  Kim Guldstrand Larsen:
  Proof System for Hennessy-Milner Logic with Recursion. CAAP 1988: 215-230
• 
  Clemens Lautemann:
  Decomposition Trees: Structured Graph Representation and Efficient Algorithms. CAAP 1988: 28-39
• 
  Max Michel, Jean-Bernard Stefani:
  Interval Logics and Sequential Transducers. CAAP 1988: 244-257
• 
  Bernhard Möller, Andrzej Tarlecki, Martin Wirsing:
  Algebraic Specification with Built-in Domain Constructions. CAAP 1988: 132-148
• 
  Tobias Nipkow:
  Unification in Primal Algebras. CAAP 1988: 117-131
• 
  Francesco Parisi-Presicce:
  Product and Iteration of Module Specifications. CAAP 1988: 149-164
• 
  Helmut Seidl:
  Parameter-Reduction of Higher Level Grammars (Extended Abstract). CAAP 1988: 52-71
• 
  Jennifer Widom, Prakash Panangaden:
  Expressiveness Bounds for Completness in Trace-Based Network Proof Systems. CAAP 1988: 200-214
• 
  Max Dauchet, Maurice Nivat:
  CAAP '88, 13th Colloquium on Trees in Algebra and Programming, Nancy, France, March 21-24, 1988, Proceedings. Lecture Notes in Computer Science 299, Springer 1988, ISBN 3-540-19021-X [contents]