default search action
Bulletin of the EATCS, Volume 35
Volume 35, June 1988
- Herbert Edelsbrunner:
The computational Geometry Column. Bull. EATCS 35: 66-68 (1988)
- Hartmut Ehrig:
The Algebraic Specification Column. Bull. EATCS 35: 69-70 (1988)
- Yuri Gurevich:
Logic in computer Science Column. Bull. EATCS 35: 71-81 (1988)
- Juris Hartmanis:
The Structural Complexity Column. Bull. EATCS 35: 82-91 (1988)
- Arto Salomaa:
The formal language theory column. Bull. EATCS 35: 82-96 (1988)
- Stefano Baratella, Gilberto Filé:
A completeness result for SLDNF resoultion. Bull. EATCS 35: 97-105 (1988) - Alberto Bertoni, Nicoletta Sabadini:
Generating functions of trace languages. Bull. EATCS 35: 106-112 (1988) - Wilfried Brauer:
On Minimizing Finite Automata. Bull. EATCS 35: 113-116 (1988) - Manfred Broy, Martin Wirsing:
Ultra-loose algebraic specifications. Bull. EATCS 35: 117-127 (1988) - Irène Guessarian:
Fixpoint strategies for deductive databases. Bull. EATCS 35: 128-136 (1988) - Uschi Heuter:
Definite tree languages. Bull. EATCS 35: 137-142 (1988) - Thomas Lengauer, Egon Wanke:
Efficient processing of hierarchical graphs for engineering design. Bull. EATCS 35: 143-157 (1988) - Antoni Lozano:
NP-Hardness on succinct representation of graphs. Bull. EATCS 35: 158-162 (1988) - Peter Padawitz:
Can inductive proofs be automated? Bull. EATCS 35: 163-170 (1988) - Lutz Priese:
Fairness. Bull. EATCS 35: 171-180 (1988) - Wolfgang Reisig:
Concurrency is more fundamental than interleaving. Bull. EATCS 35: 181-184 (1988) - Harrie C. M. de Swart, W. M. J. Ophelders:
Another tableau based automated theorem prover for classical logic. Bull. EATCS 35: 185-197 (1988) - Ingo Wegener:
Prime implicants and parallel complexity. Bull. EATCS 35: 198-204 (1988)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.