default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBulletin of the EATCS, Volume 42
Volume 42, October 1990
- Herbert Edelsbrunner:
The Computational Geometry Column. Bull. EATCS 42: 132-134 (1990)
- Hartmut Ehrig, Michael A. Arbib:
Linking Schemas and Module Specifications: A Proposal. Bull. EATCS 42: 135 (1990)
- Yuri Gurevich:
On the Classical Desicion Problem. Bull. EATCS 42: 140-150 (1990)
- Richard Chang, Pankaj Rohatgi:
On Unique Staisfiability and Randomized Reductions. Bull. EATCS 42: 151-159 (1990)
- Lila Santean:
Parallel Communicating Systems. Bull. EATCS 42: 160-171 (1990)
- Richard Chang:
An Example of a Theorem that has Contradictory Relativization and Diagonalization Proof. Bull. EATCS 42: 172-173 (1990) - Andrzej Lingas:
A Note on a Parallel Heuristic for Minimum. Bull. EATCS 42: 174-177 (1990) - Arto Salomaa, Lila Santean:
Secret Selling of Secrets with Several Buyers. Bull. EATCS 42: 178-186 (1990) - Rolf Socher-Ambrosius:
Another Technique for Proving Completeness of Ground Resolution. Bull. EATCS 42: 187-189 (1990) - Iain A. Stewart:
On The Graph Accessibility Problem for Directed Graphs of Bounded Degree. Bull. EATCS 42: 190-193 (1990) - Friedrich J. Urbanek:
A Simple Completeness Proof for Early's Algorithm. Bull. EATCS 42: 194 (1990) - Robin W. Whitty:
An Exercise in Weakest Preconditions. Bull. EATCS 42: 195-198 (1990)
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.
last updated on 2025-12-01 23:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
