Conferences in DBLP

Colloquium on Trees in Algebra and Programming (CAAP) (caap)
1988 (conf/caap/1988)

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