Abstract is missing.
- A Tree Pattern Matching Algorithm with Reasonable Space RequirementsJochen Burghardt. 1-15
- On the Maximum Path Length of AVL TreesRolf Klein, Derick Wood. 16-27
- Decomposition Trees: Structured Graph Representation and Efficient AlgorithmsClemens Lautemann. 28-39
- On Counting and ApproximationJohannes Köbler, Uwe Schöning, Jacobo Torán. 40-51
- Parameter-Reduction of Higher Level Grammars (Extended Abstract)Helmut Seidl. 52-71
- Analysis of Dynamic Algorithms in D. E. Knuth s ModelJean Françon, B. Randrianarimanana, René Schott. 72-88
- On Comleteness of Narrowing StrategiesRachid Echahed. 89-101
- Implementing Term Rewritin Languages in DactlRichard Kennaway. 102-116
- Unification in Primal AlgebrasTobias Nipkow. 117-131
- Algebraic Specification with Built-in Domain ConstructionsBernhard Möller, Andrzej Tarlecki, Martin Wirsing. 132-148
- Product and Iteration of Module SpecificationsFrancesco Parisi-Presicce. 149-164
- Equational Completion in Order-Sorted Algebras (Extended Abstract)Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner. 165-184
- Proving Systolic ArraysE. Pascal Gribomont. 185-199
- Expressiveness Bounds for Completness in Trace-Based Network Proof SystemsJennifer Widom, Prakash Panagaden. 200-214
- Proof System for Hennessy-Milner Logic with RecursionKim Guldstrand Larsen. 215-230
- Regular Automata and Model CheckingZ. Habasinski. 231-243
- Interval Logics and Sequential TransducersMax Michel, Jean-Bernard Stefani. 244-257
- A²CCS: A Simple Extension of CCS for Handling Atomic ActionsRoberto Gorrieri, Sergio Marchetti, Ugo Montanari. 258-270
- Modeling Statecharts Behaviour in a Fully Abstract WayCornelis Huizing, Rob Gerth, Willem P. de Roever. 271-294
- Directed Hypergraphs: Data Structures and ApplicationsGiorgio Ausiello. 295-303