default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 80
Volume 80, Number 1, 1989
- Leen Torenvliet, Peter van Emde Boas:
Simplicity, Immunity, Relativizations and Nondeterminism. 1-17 - Hans Kleine Büning, Ulrich Löwen:
Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility. 18-43 - Miklos Santha:
Relativized Arthur-Merlin versus Merlin-Arthur Games. 44-49 - Pierre-Louis Curien, Adam Obtulowicz:
Partiality, Cartesian closedness and Toposes. 50-95
Volume 80, Number 2, 1989
- Jan Willem Klop, Roel C. de Vrijer:
Unique Normal Forms for Lambda Calculus with Surjective Pairing. 97-113 - Joost Engelfriet:
The Power to Two-Way Deterministic Checking Stack Automata. 114-120 - Gilles Bernot:
Correctness Proofs for Abstract Implementation. 121-151 - Vijay V. Vazirani:
NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems. 152-164 - Patrick Cousot, Radhia Cousot:
A Language Independent Proof of the Soundness and Completeness of Generalized Hoare Logic. 165-191
Volume 80, Number 3, 1989
- Howard J. Karloff, Walter L. Ruzzo
:
The Iterated Mod Problem. 193-204 - Patrick W. Dymond, Stephen A. Cook:
Complexity Theory of Parallel Time and Hardware. 205-226 - J. Ross Quinlan, Ronald L. Rivest:
Inferring Decision Trees Using the Minimum Description Length Principle. 227-248 - Sara Porat, Nissim Francez:
Fairness in Context-Free Grammars under Every Choice-strategy. 249-268 - Birgit Jenner, Bernd Kirsig, Klaus-Jörn Lange:
The Logarithmic Alternation Hierarchy Collapses: A∑2L = A∏2L. 269-287
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-09 23:25 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:
