Bulletin of the EATCS, Volume 35

Volume 35, June 1988

The computational Geometry Column

The Algebraic Specification Column

The Logic in Computer Science Column

The Structural Complexity Column

The Formal Language Theory Column

Technical Contributions

Stefano Baratella, Gilberto Filé: A completeness result for SLDNF resoultion. 97-105 BibTeX
Alberto Bertoni, Nicoletta Sabadini: Generating functions of trace languages. 106-112 BibTeX
Wilfried Brauer: On Minimizing Finite Automata. 113-116 BibTeX
Manfred Broy, Martin Wirsing: Ultra-loose algebraic specifications. 117-127 BibTeX
Irène Guessarian: Fixpoint strategies for deductive databases. 128-136 BibTeX
Uschi Heuter: Definite tree languages. 137-142 BibTeX
Thomas Lengauer, Egon Wanke: Efficient processing of hierarchical graphs for engineering design. 143-157 BibTeX
Antoni Lozano: NP-Hardness on succinct representation of graphs. 158-162 BibTeX
Peter Padawitz: Can inductive proofs be automated? 163-170 BibTeX
Lutz Priese: Fairness. 171-180 BibTeX
Wolfgang Reisig: Concurrency is more fundamental than interleaving. 181-184 BibTeX
Harrie C. M. de Swart, W. M. J. Ophelders: Another tableau based automated theorem prover for classical logic. 185-197 BibTeX
Ingo Wegener: Prime implicants and parallel complexity. 198-204 BibTeX