Bulletin of the EATCS, Volume 42

Volume 42, October 1990

• Herbert Edelsbrunner: The Computational Geometry Column. 132-134 BibTeX

• Hartmut Ehrig, Michael A. Arbib: Linking Schemas and Module Specifications: A Proposal. 135 BibTeX

• Yuri Gurevich: On the Classical Desicion Problem. 140-150 BibTeX

• Richard Chang, Pankaj Rohatgi: On Unique Staisfiability and Randomized Reductions. 151-159 BibTeX

• Lila Santean: Parallel Communicating Systems. 160-171 BibTeX

• Richard Chang: An Example of a Theorem that has Contradictory Relativization and Diagonalization Proof. 172-173 BibTeX
• Andrzej Lingas: A Note on a Parallel Heuristic for Minimum. 174-177 BibTeX
• Arto Salomaa, Lila Santean: Secret Selling of Secrets with Several Buyers. 178-186 BibTeX
• Rolf Socher-Ambrosius: Another Technique for Proving Completeness of Ground Resolution. 187-189 BibTeX
• Iain A. Stewart: On The Graph Accessibility Problem for Directed Graphs of Bounded Degree. 190-193 BibTeX
• Friedrich J. Urbanek: A Simple Completeness Proof for Early's Algorithm. 194 BibTeX
• R. W. Whitty: An Exercise in Weakest Preconditions. 195-198 BibTeX