Bulletin of the EATCS, Volume 35

Volume 35, June 1988

• Herbert Edelsbrunner: The computational Geometry Column. 66-68

• Hartmut Ehrig: The Algebraic Specification Column. 69-70

• Yuri Gurevich: Logic in computer Science Column. 71-81

• Juris Hartmanis: The Structural Complexity Column. 82-91

• Arto Salomaa: The formal language theory column. 82-96

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

Last update Tue Feb 14 04:17:12 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page